title: BST with duplicates
body: <p>I know that, <code>BST</code> does not allow duplicates. For example, if I have a word "RABSAB".</p>
  
  <p>The Binary search tree for the above string is:</p>
  
  <pre><code>    R
      /\
     A  S
      \
       B
  </code></pre>
  
  <p>What if we wanted to include the duplicates in the tree. How the tree gonna change? I was asked this question in an interview.</p>
  
  <p>They asked me to draw:</p>
  
  <ol>
  <li>a binary tree</li>
  <li>an unbalanced Binary Search Tree</li>
  <li>a binary search tree without duplicates</li>
  <li>a binary search tree with duplicates</li>
  </ol>
  
  <p>Any Help is appreciated!</p>
  
  <p>PS: Help me by drawing the related trees</p>