AVL tree is a self-balancing binary search tree in which each node maintains extra information called a balance factor whose value is either -1, 0 or +1.
AVL tree got its name after its inventor Georgy Adelson-Velsky and Landis.
Mahgabin18/AVL-tree
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|