In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from? a) leaf to root b) root to node c) root to leaf d) left subtree to right subtree

Given the following keys T, Y, V, Q, F, B, M. N, W, G, C, A, P, R, L. 1. Assuming the keys are inputted in that order, build a binary search tree according to the input: 2. Use an array to implement the tree you built and show the contents of the array: 3. Assuming the keys are all available at once and you can change the order if necessary, build a balanced binary search tree:

11. Preorder Traversal What is the preorder traversal order of the following tree: 3 Pick ONE option 1, 2, 4, 5, 3 4, 2, 5, 1, 3 4,5, 2, 3, 1 1,2, 3, 4, 5 Clear Selection

The Delete algorithm for a binary search tree retrieves and deletes the inorder successor when the node being deleted has two children. In this case the inorder successor is found as: O a. the smallest value in the left subtree. O b. the largest value in the right subtree. O c. the largest value in the left subtree. O d. None of these are correct O e. the smallest value in the right subtree.