title: What rule to obey while inserting node into the binary tree?
body: <p>I know that in Binary Search Tree the elements are inserted based on there properties of inequality i.e: </p>
  
  <pre><code> if(n-&gt;val &gt; val) insert(n-&gt;left, val);  // root node greater then val insert to left 
   else if(n-&gt;val &lt; val) insert(n-&gt;right, val);  // root node less then val insert to left 
  
   // I am ignoring the case when n-&gt;val == val here
  </code></pre>
  
  <p>I was curious on what basis should I insert the node into the pure (vanilla) binary tree, if there is one or do all the binary tree come with some extra property (binary search tree with its inequalities). </p>