Noun
AVL tree (plural AVL trees)
English Wikipedia has an article on:AVL treeWikipedia
(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.
In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Source: Internet
Rotations for rebalancing Pictorial description of how rotations cause rebalancing in an AVL tree. Source: Internet
In fact, every AVL tree can be colored red–black. Source: Internet
The AVL tree is another structure supporting O(log n) search, insertion, and removal. Source: Internet
To create this AVL tree, add to an empty tree. Source: Internet