Solve parts a, b, c, d of questions 2. (part d is solved; just check)

Print the tree in Postorder form and Preorder form in the following table. Q2 b) (2 marks) Use the BST you drew in Q2a to answer this quession. What nodes will replace the nodes 27 and 48 after deleting them (use the left subtree when deleting): \begin{tabular}{|l|l|l|} \hline Nodes to delete & 27 & 48 \\ \hline Nodes to replace & & \\ \hline \end{tabular} Q2 c) (7 marks) The binary soarch tree (BST). TreoType class, is to be extended by adding a function, numberOmodes, which returns the fotal number of nodes in the BST. You mu withe and calla recursive method called numberOmodesHelper to implement the numberOONodes function. 28132538201245 Show kow the keap condtucted toen the hambers above a siored in an wray. Show tha uwape that happen for the frat pase of the heapsert alghithme