QUESTION $4$

Answer all parts.

$($a$)$ Show the inorder, preorder, and postorder of the following Binary Search Tree.

$(12$ marks$)$

$($b$)$ What is the most number of nodes a Binary Tree of depth $d$ can have? What is a node without children called?

$(2$ marks$)$

$($c$)$ Provide the pseudocode for the Tree$-$Delete algorithm.

$(11$ marks$)$

Total $(25$ marks$)$