AVL Tree Student ID Database

C++ | Visual Studio | AVL Tree | Preorder Traversal | Inorder Traversal | Postorder Traversal

I programmed a working AVL tree that stored unique student IDs and non-unique student names. In my implementation, the tree was able to insert, search, and remove specific IDs or names. I also implemented Preorder, Inorder, and Postorder node traversal methods over the entire AVL tree.

VIEW AVL TREE INFO