The AVL tree is a self-balancing binary tree. The operations take O(log n) time in average and worst cases, to ensure that, when inserting or deleting a node from the tree it uses tree rotations to restructure the tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
Arch23/AVL
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
AVL tree implementation in C and Java
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published