Answer the following questions about treeB. a. What is the height of the tree? b. Which nodes are on level 3? c. Which levels have the maximum number of nodes that they could contain?

Q2. a. What is a Binary Search Tree?                                                                                         b. Draw the Binary Search Tree that results from the insertion, one at a time, of nodes with            Keys 27, 59, 21, 38, 54, 63, 8, 70, 15, 12.          (Marking Scheme: Each correct insertion in the tree will give you       c. Perform the following operations on the original tree and redraw the tree after each operation            )                                                                          i.deleting   63                        ii.deleting   59                            iii.Insert      65                       iv.Insert       22      d. Write down the inorder, preorder and postorder traversal on the constructed binary tree.

A full binary tree of height h has n=2h+1-1 nodes level 0: 1, level 1: 2, level 2: 22=4 level h: 2h Total nodes: n=2h+1-1 30 10 8 18 28 40 9 15 22 29 35 7 24 12 32 6. 14 23 27 13 20

Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook.  Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)