title: Sort alphabet letters using a Binary tree
body: <p>I came across an interview question which states: How would you represent the letters <code>A</code>, <code>B</code>, <code>C</code>, <code>D</code>, <code>E</code>, <code>F</code> and <code>G</code> in a sorted order using a binary tree representation?</p>
  
  <p>It's really stumped me. If we take <code>G</code> to be the root of the tree then the left child would <code>E</code> and the right child would be <code>F</code> so that the right subtree is "greater than" the left subtree. Then for the node E, its left child would be A and the right child <code>B</code> and <code>F</code>'s left child would be <code>C</code> and its right child would be <code>D</code>.</p>
  
  <p>Is that correct or does anyone else have a different answer?</p>