Page 1 of 1

3. AVL TREE a Into empty AVL Tree: i (10%) Insert the following values: 6, 27, 19, 11, 36, 14, 81, 63, 75 ii (10%) Delet

Posted: Mon Jun 06, 2022 6:07 pm
by answerhappygod
3 Avl Tree A Into Empty Avl Tree I 10 Insert The Following Values 6 27 19 11 36 14 81 63 75 Ii 10 Delet 1
3 Avl Tree A Into Empty Avl Tree I 10 Insert The Following Values 6 27 19 11 36 14 81 63 75 Ii 10 Delet 1 (53.42 KiB) Viewed 30 times
3. AVL TREE a Into empty AVL Tree: i (10%) Insert the following values: 6, 27, 19, 11, 36, 14, 81, 63, 75 ii (10%) Delete the following values: 14, 75, 36, 19, 11 b. (30%) Write a program to insert, delete and print datas from AVL Tree insertion in C Program 1. Insertion 2. Deletion 3. Traversal 4. Exit Choose: 1 Insertion In this menu, the program will asked the value that the user want to insert into AVL tree 1. Insertion 2. Deletion 3. Traversal 4. Exit lehe Choose: 1 Insert: Insert: 6 ii. Deletion Delenion 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' 1. Insertion A 2. Deletion 3. Traversal 4. Exit Choose: 2 Delete: 14 Data Found Value 14 was deleted

1. Insertion 2. Deletion 3. Traversal 4. Exit Choose: 2 Delete: 7 Data not found iii. Traversal In this menu, the program will print all datas from AVL tree in preorder, inorder and postorder 1. Insertion 2. Deletion 3. Traversal 4. Exit Choose: 3 Preorder: 19 11 6 14 36 27 75 63 81 Inorder: 11 6 14 19 36 27 75 63 81 Postorder: 11 6 14 36 27 75 63 81 19 1. Insertion 2. Deletion 3. Traversal 4. Exit Choose: 4 Thank you iv. Exit