title: How to create a binary tree
body: <p>I did'nt mean binary search tree.</p>
  
  <p>for example, 
  if I insert values 1,2,3,4,5 in to a binary search tree the inorder traversal will give
  1,2,3,4,5 as output.</p>
  
  <p>but if I insert the same values in to a binary tree, the inorder traversal should give
  4,2,5,1,3 as output.</p>
  
  <p>Binary tree can be created using dynamic arrays in which for each element in index n,
  2n+1 and 2n+2 represents its left and right childs respectively.</p>
  
  <p>so representation and level order traversal is very easy here.</p>
  
  <p>but I think, in-order,post-order,pre-order is difficult.</p>
  
  <p>my question is how can we create a binary tree like a binary search tree.
  ie. 
  have a tree class which contains data, left and right pointers instead of arrays.
  so that we can recursively do traversal.</p>