An AVL tree is a type of binary search tree that is always in a state of partially balanced. The balance is measured as a difference between the heights of the subtrees from the root. This self-balancing tree was known to be the first data structure to be designed as such.

Sujan Bk
Jan 9, 2022
More related questions

Questions Bank

View all Questions

Top