For the binary search tree shown in the figure below, Suppose we remove the root, replacing it with something from the left subtree. What will be the new root? 14 2 16 Select one: O a. 4 O b. 1 O c. 2 d. 5

Please fill in the gaps and answer the questions.

Use Java to create a Binary Search Tree Class with the following Operations: Insert(int n) : add a node the tree with value n. Its O(lgn) Find(int n) : find a node the tree with value n. Its O(lgn) Delete (int n) : delete a node the tree with value n. Its O(lgn) Display(): prints the entire tree in increasing order. O(n).

For the following questions, perform the operations in sequence. So, for example, part (b) should use part (a) as input. Follow the conventions regarding deletion and duplicate insertion used in class. Make a binary search tree by inserting the numbers 25, 14, 3, 2, 23, 75, 62, 52, 82, 79, 15, 100, 1, 18, 24, 8, 65, 5, 12, and 80 one at a time. You only need to show the final result, not each step. (a) Insert 55 into the tree. DInsert 14 into the tree.