Page 1 of 1
2. (40') AVL Trees 2.1. (15) Construct an AVL tree by inserting the input array {13, 25, 58, 80, 15, 82, 6, 65, 29, 70,
Posted: Fri May 20, 2022 5:41 pm
by answerhappygod
- 2 40 Avl Trees 2 1 15 Construct An Avl Tree By Inserting The Input Array 13 25 58 80 15 82 6 65 29 70 1 (56.41 KiB) Viewed 27 times
- 2 40 Avl Trees 2 1 15 Construct An Avl Tree By Inserting The Input Array 13 25 58 80 15 82 6 65 29 70 2 (56.41 KiB) Viewed 27 times
- 2 40 Avl Trees 2 1 15 Construct An Avl Tree By Inserting The Input Array 13 25 58 80 15 82 6 65 29 70 3 (56.41 KiB) Viewed 27 times
2. (40') AVL Trees 2.1. (15) Construct an AVL tree by inserting the input array {13, 25, 58, 80, 15, 82, 6, 65, 29, 70, 68). Draw the tree after inserting all the nodes and the trees after deleting each of the two elements: 13 and 58, respectively. (You need to draw three trees in total) 2.2. (25") Given an array A of distinct integers, make use of the AVL tree to sort A in ascending order. a) (20) Write the C code for your algorithm. Note that: • you may use the Node struct and the functions insertNode(), destroy Tree() defined in the lecture notes without implementation; • you may define auxiliary functions; • and you do not have to write any include preprocessor. n- void AVLSort(int *A, int nx // input: A an array containing distinct integers // the size of A // when AVLSort() completes, A is sorted. // Your code here } output: b) (5) Prove that the time complexity of your algorithm is O(nlogn). Note: you do not have to prove the complexity of insertNode() and destroyTree().