AVL-Tree

AVL-Tree — АВЛ-Дерево.

A binary search tree is an AVL-tree, if for each internal node [math]\displaystyle{ \,u }[/math] with children [math]\displaystyle{ \,v_{1} }[/math] and [math]\displaystyle{ \,v_{2} }[/math], [math]\displaystyle{ |height(v_{1}) - height(v_{2})| \leq 1. }[/math]

See

• Heightbalanced tree.