Question $11(10$ points$)$

Answer the following questions about the given binary search tree:

a$.$ What is the height of the tree? $4$

b$.$ Which nodes are on level $3?$ B J P W

c$.$ Which levels have the maximum number of nodes that they could contain? $0,1$ & $2//2$n nodes per level

d$.$ What is the maximum height of a binary search tree containing these nodes? N$-1=12-1=11$

e$.$ What is the minimum height of a binary search tree containing these nodes? log$212$

f$.$ What is the order in which nodes are visited by a preorder traversal?

g$.$ What is the order in which nodes are visited by an inorder traversal?

h$.$ What is the order in which nodes are visited by a postorder traversal?

i$.$ What is the order in which nodes are visited by a depth$-$first traversal?

j$.$ What is the order in which nodes are visited by a breadth$-$first traversal?