AVL (Adelson-Velskii and Landis) tree. An AVL tree is identical to a BST except height of the left and right subtrees can differ by at most 1.height of an empty tree is defined to be (–1).
11. Inserting New Node in AVL Tree A B T 3 1 http://ecomputernotes.com 1 0 T 1 T 2
12. Inserting New Node in AVL Tree A B T 3 new 1 2 http://ecomputernotes.com 2 1 T 1 T 2
13. Inserting New Node in AVL Tree A B T 3 new 1 2 A B T 3 new Inorder: T 1 B T 2 A T 3 Inorder: T 1 B T 2 A T 3 http://ecomputernotes.com 2 1 T 1 T 2 0 0 T 1 T 2