title: Storing inorder traversal of tree C
body: <p>How do we store the elements of tree in an array using inorder traversal ?
  I read people saying store parent index at i and left child 2*i+1 and right ar 2*i+2 .But it does not work for me ? 
  Help needed :)</p>