$-$ Rearrange the sequence to print a "left$-$leaning" tree $($no right subtrees for any node$)$

Research Challenges

Often programmers must look up how to do things because no one can know all there is to know in coding. These challenges test in part your ability to research how to do particular things. For all these questions provide references for where you learned what you needed to know to solve the problem. $\backslash (-10\backslash \%\backslash )[1\mathrm{.}2$ hour$]$

$3.$ Look up the binarytree module. Do all the same tests on it that you are required to do on BST for question $1.[1\mathrm{.}2$ hour challenge$]$