Skip to content

A C++ AVL tree implementation for efficiently managing student IDs, using self-balancing rotations and recursive functionality to maintain a balanced binary search structure.

Notifications You must be signed in to change notification settings

kluan01/Student-AVL-Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

IDE: CLion
Compiler: C++17

Functionality of Commands

insert NAME ID - Add a Student object into the tree with the specified NAME & student ID.
remove ID - Find and remove the account with the specified ID from the tree.
search ID - Search for the student with the specified ID from the tree.
search NAME - Search for the student in the tree with the specified NAME.
removeInorder N - Remove the Nth student ID from the inorder traversal of the tree (N = 0 for the first item, etc).

printInorder - self explanatory for following tree traversal commands
printPreOrder
printPostOrder
printLevelCount

To Test:

  1. Clone and download dependencies found in CMakeList
  2. In the first line, name the number of lines/commands for the input
  3. Name your command

Example Input:

8
insert "Brandon" 45679999
insert "Brian" 35459999
insert "Briana" 87879999
insert "Bella" 95469999
printInorder
remove 45679999
removeInorder 2
printInorder

Example Output:

successful
successful
successful
successful
Brian, Brandon, Briana, Bella
successful
successful
Brian, Briana

About

A C++ AVL tree implementation for efficiently managing student IDs, using self-balancing rotations and recursive functionality to maintain a balanced binary search structure.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published