Chapter 26.8, Problem 26.8.3CP

Program Plan Intro

Adelson-Velskii and Landis (AVL) tree:

• Adelson-Velskii and Landis tree is a well-balanced binary tree which is named after scientists G. M. Adelson-Velsky and E. M. Landis.
• In this tree, the difference between the heights of two different sub trees for every node may be 0 or 1.
• The process of insertion and deletion of an element in an AVL tree is same as in binary search tree except the concept of rebalancing the tree again after insertion and deletion.