title: Convert Level Order Traversal to Inorder Traversal of a complete binary tree
body: <p>Given the level order traversal of a complete binary tree in an array, how to store the inorder traversal of the said tree in the given array, without building up the tree. 
  This is what I came up with.</p>
  
  <pre><code>void recurse (int *inp, int size_array, int *output, int iter_a, int &amp;iter_b)
  {
      if (iter_a&gt;=size_array)
          return;
  
      recurse (inp,size_array,output,2*iter_a+1,iter_b);
  
  
      output[iter_b] = inp[iter_a];
      iter_b++;
  
  
      recurse (inp,size_array,output,2*iter_a+2,iter_b);
  
  }
  </code></pre>
  
  <p>Is there an in-place non-recursive O(n) solution for the said problem?</p>