A generic AVL binary tree implementation which supports insertion, deletion and lookup in log(n) time. The self balancing algorithm checks whether two subtrees of a node differ in height by more than 1, and if so, rotate the node accordingly.
-
Notifications
You must be signed in to change notification settings - Fork 0
vkucalo/AVL-Tree
About
A generic AVL tree implementation
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published