Question $9$ Consider the pseudocide operation readTree.

a$.$ What binary search tree results when you execute readTree with a file of the six integers $2,4,6,8,10,12,?$

b$.$ Is the resulting tree's height a minimum? Is the tree complete? Is it full?

$//$ Builds a minimum$-$height binary search tree from $n$ sorted values in a file.

$//$ Returns a pointer to the tree's root.

readTree$($n: integer$)$: BinaryNodePointer

if $)>(0$

$\{$

$//$ Get the root

treePtr $=$ pointer to new node with nu$11$ ptr as its child pointers

rootItem $=$ next item from file

treePtr $>$ setItem$($rootItem$)$

$//$ Construct the left subtree

leftPtr $=$ readFu$11$Tree$($treePtr$->$getLeftChi$1$dPtr$(),\frac{n}{2})$

treePtr $$ setLeftChildPtr $($leftPtr$)$

$//$ Construct the right subtree

rightPtr $=$ readFu$11$Tree$($treePtr$->$getRightChildPtr$($