title: BST element ordering
body: <p>In a BST (binary search tree), can <em>any</em> element to the right of the root node be <em>smaller</em> than the root node?</p>
  
  <p>Ie, root is 4, right child is 10, then the left child of that right child is -234</p>
  
  <p>Is it possible/allowed in the definition?</p>