A BST is height balanced if for every node, the difference between the number of nodes in its left subtree

and the number of nodes in the right subtree is at most one. $[30$ min challenge$]$

Given the following sequence of operations:

s $=$ BST$()$

s$.$put$(0,$ A$)$

s$.$put$(1,$ B$)$

s$.$put$(2,$ C$)$

s$.$put$(3,$ D$)$

s$.$put$(4,$ E$)$

s$.$put$(5,$ F$)$

s$.$put$(6,$ G$)$

print$($s$.$root$)$

Rearrange the sequence to print a height$-$balanced tree

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