AVL - Node-based self-balancing binary search tree data structure. The height difference of the left and right subtrees must not differ by more than one unit, that is, the balancing factor of each subtree must be -1,0 or 1.
-
Notifications
You must be signed in to change notification settings - Fork 0
Taresu/balanced_binary_search_tree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Balanced Binary Search Tree. The height difference of the left and right subtrees must not differ by more than one unit, that is, the balancing factor of each subtree must be -1,0 or 1.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published