AVL Trees I
AVL Trees allow us to re-organize the nodes of the tree as we receive new keys, maintening a near optimal tree structures.
An AVL Tree is a height-balanced tree, i.e., a tree that places a limit on the amount of difference allowed between the heights of any two sub-trees sharing a common root.
In an AVL or HB-1 tree, the maximum allowable difference is one.