AVL tree
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.
Noun[edit]
- (computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.