Binary search trees a. If a preorder traversal were used to print the keys in the nodes of the tree at right, what would be output? b. If a postorder traversal were used to print the keys in the nodes, what would be output? c. Show the tree as it will appear if 25 is inserted, followed by 51. d. Suppose we have the original tree (as in a.) and that 53 is deleted and then 35 is deleted, using the algorithm from the lecture notes. Show the final tree. 44 35 53 23 48 62 (28 57 80