title: Modify a binary search tree
body: <p>I am trying to write a method for a binary search tree class to modify a balanced a normal tree which makes the tree have nodes only on one side.</p>
  
  <p>From the order in which the elements are appearing in the unbalanced tree, to me there seems to be some relation between the In Order Traversal (Left, Middle, Right).</p>