$(2)$ For the following problems, state if the shown trees are FULL, BALANCED, COMPLETE,

or NONE. $(5$pts$.$ each$)$

$(2.$EX$)$

TREE IS FULL: Each non$-$terminal node has TWO children.

NOT BALANCED: The tree has a maximum depth of $3.$ If it was balanced, all terminal nodes

would be at layers $2$ or $3($the two deepest layers$).$ There is a terminal node at layer $1$ shown in

blue, therefore it cannot be balanced. NOT COMPLETE: Tree is missing data shown in red. If tree was complete, there would

missing data before the final terminal node at the deepest layer.

$(2\mathrm{.}1)$

$(2\mathrm{.}2)$