Quiz - AVL Tree

Important: If you are working as a group, list the names of those in your group.  Only ONE quiz will be turned in for the entire group. 

Height -Balance Property: For every internal node v of T, the heights of the children of v differ by at most 1.

AVL Tree: Any binary search tree T that satisfies the height-balance property if said to be an AVL tree, named after the initial of its inventors: Adel'son-Vel'skii and Landis.

In this practice quiz, you will be answering several questions about operations associated with an AVL tree.