First page Back Continue Last page Graphics
AVL Trees
AVL Trees are Binary Search Trees with the additional notion of “height” for subtrees.
Height information can be represented as a member field of the Node class just like color for Red-Black trees.
Except that at least a byte is required compared to a bit.
Height of any node can be computed by adding 1 to the height of the taller of the left or right subtrees.