Self-Balancing BST

A self-balancing binary search tree built in C++ including input validation, rotation, inorder, preorder, and postorder traversal, and functions including insert, remove, and remove in order.

Comment

This project was completed as part of my Data Structures and Algorithms class. The program takes arguments from the user as input, processes that input, and performs the requisite command. These commands are as follows:

insert [name] [id]

remove [id]

search [id]

search [name]

printPreorder

printPostorder

printLevelCount

removeInorder N

Together, these commands allow the user to store name and ID pairs in a binary search tree that self-balances whenever necessary by checking balance factors after insertion or deletion.

What's next for Self-Balancing BST

Potential usage in another one of my projects in the future, if I want to use a self-balancing BST that I have a working understanding of already.

Built With

Share this project:

Updates