AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. 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.
-
Notifications
You must be signed in to change notification settings - Fork 0
Aminsaffar/AVL-Tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
AVL Tree in c++
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published