Reference no: EM133940435
Questions
1. Find the k-th (the k-th smallest element refers to the median [ceil(n/2)] of the list) smallest element in the following list using Quick Select: 17, 19, 11, 31, 51, 42, 4
2. Insert the following nodes 53, 39, 25, 78, 55, 63 and construct an AVL tree.
Indicate the node and type of rotation used, whenever necessary. Show all intermediate steps.
List the preorder, inorder and postorder traversals of the nodes of the AVL tree after completing all insertions/rotations.
3. Insert the following key values: A, L, G, O, R, I, T, H, M and construct a 2-3 tree. Show all intermediate steps.
4. Apply the Heapsort algorithm on the following array values: 54, 21, 1, 2, 31, 71, 23, 10 Show your work. Give a list of the updated array values at the end of each max-delete operation.