$($Do not write Java programs$)$

$1.(10$ points$)$

a$.$ Draw a binary search tree for the following sequence of keys which are arrived in order.

Add each key to the tree one at a time.

$29,35,18,4,8,49,30,5,23,33$

b$.$ Remove the node $18$ and redraw the tree.

c$.$ Pre$-$order traverse the binary search tree above.

d$.$ Post$-$order traverse the binary search tree above.

e$.$ In$-$order traverse the binary search tree above.