1 a) Build a binary search tree by inserting the following elements (show all intermediate trees and then the final BST): 10, 15, 5, 13, 30, 25, 20, 23, 65, 50, 40.

b) The following algorithm finds a certain value in a BST. What is the output if the following operation is done on the BST above? Explain the functionality of the following procedure.

c) Write a recursive procedure that performs the same operation as the FOO function above.

FOO(x) // x is the root of the tree While X.right?nil do x = x.right return x