title: Exam question about inserting to a empty binary search tree
body: <p>I'm having trouble interpreting a certain question about inserting elements to a binary search tree. I'm familiar with preorder, postorder, and inorder traversals, but I'm unfamiliar with the following question:</p>
  
  <blockquote>
    <p>Suppose that we insert the elements 3, 5, 6, 1, 2, 4, 7 in that order into an initially empty binary search tree.</p>
  </blockquote>
  
  <p>If I'm only given a set of numbers that are inserted in that order, how am I supposed to make it into a binary search tree? Would 3 be the root? And would I just balance the other numbers to the correct subtree by myself? Wouldn't there be a lot of interpretations in that case? Is there a certain convention that is followed?</p>
  
  <p>Thanks.</p>