Consider inserting six elements into an empty binary search tree $($BST$)$ by calling the

Tree$-$Insert procedure six times.

TREE$-$INSERT $(x,z)$

if $x==$ NIL

$x=z$

return

if z$.$key $x.$left$==x=zz*p=xzx===zz*p=xz6,5,4,3,2,14,3,5,2,6,13,2,5,1,6,42,1,5,3,6,4$

$ifx.$left$==$ NIL

$x.$ left $=z$

$z*p=x$

else TREE$-$INSERT$(x.$left, $z)$

else

$ifx.$right $==$ NIL

$x.$right $=z$

$z*p=x$

else TREE$-$INSERT$(x.$right, $z)$

Which $of$ the given

insertion orders will result

$6,5,4,3,2,1$

$in$ a $BST$ with the minimum

height?

$4,3,5,2,6,1$

Which $of$ the given

$3,2,5,1,6,4$

insertion orders will result

$in$ a $BST$ with the maximum

$2,1,5,3,6,4$

height?