Imagine you are given the following series of keys and asked to build a valid binary search tree.

$6,2,7,8,4,5,9$

You must insert the keys into the tree in the order you receive them.

What will the tree look like when you are done?

You can use any notation you are comfortable with, for example:

A

$11$

B $C$

as well as text to explain the node placement.

Is this a desirable shape for a BST$?$ Why or why not?

If you could adjust the placement of the nodes to improve the tree, what would your tree look like?