Create an AVL Tree from 12, 56, 1, 78, 90, 23, 14, 6, 100, 88, 85

Please solve

Construct AVL trees by inserting the elements successively, starting with the empty tree. a) 1, 2, 3, 4, 5, 6 b) 6, 5, 4, 3, 2, 1 c) 3, 6, 5, 1, 2, 4 (Note: Observe the final trees and you will find that although all of them have the same data, the tree are not necessarily the same.)

What will be the Inorder traversal of the following tree?*           11, 20, 29, 32, 41, 50, 65, 72, 91, 99       11, 20, 29, 32, 50, 65, 72, 91, 99, 41       11, 32, 50, 72, 99, 29, 65, 91, 20, 41       41, 20, 11, 29, 32, 65, 50, 91, 72, 99       41, 20, 11, 65, 91, 99, 29, 32, 50, 72