AVL-Tree

a. Into empty AVL Tree:

i. Insert the following values: 6, 27, 19, 11, 36, 14, 81, 63, 75

ii. Delete the following values: 14, 75, 36, 19, 11

b. Write a program to insert, delete and print datas from AVL Tree insertion in C Program

i. Insertion In this menu, the program will asked the value that the user want to insert into AVL tree. Do the insertion in (a).

ii. Deletion In this menu, the program will asked the value that the user want to delete from AVL tree. If the value is found in the tree, than it will be deleted otherwise the program gives message ‘data not found’. Do the deletion in (a).

iii. Traversal In this menu, the program will print all datas from AVL tree in preorder, inorder and postorder

iv. Exit