dragomirevgeniev / efficient-avl-tree Goto Github PK
View Code? Open in Web Editor NEWMy solution of the problem in the DSA course in FMI. AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
Home Page: https://github.com/nikoladimitroff/DSA-Demo-Library/blob/master/homeworks/course_projects.md
License: MIT License