title: Binary search tree with strings
body: <p>I have a book that explains the theory behind binary search tree in a very bad way i know that there is something about the order of both left and right child but i still cannot get the idea about one being greater than the other previous level.</p>
  
  <p>Take for example this tree of strings:</p>
  
  <p><img src="https://i.stack.imgur.com/mcjSZ.png" alt="Binary tree of names"> </p>
  
  <p>(sorry for my paint) this example is taken directly from my book :)</p>
  
  <p>Could someone explain the order to me ? what is the logic behind this?</p>