title: Finding minimum height of binary tree with given inorder and level-order traversals
body: <p>The inorder and levelorder traversals for a binary tree along with the total number of nodes is given in a function definition, we have to calculate the minimum height of binary tree for the given inputs.</p>
  
  <p>Can we calculate without constructing the tree?</p>
  
  <pre><code>func(int[] inorder, int[] levelorder, int n)
  {
    // write code here
  }
  </code></pre>
  
  <p>for example</p>
  
  <ul>
  <li>inorder traversal - <code>{ 4,2,5,1,6,3,7}</code>,</li>
  <li>levelorder traversal - <code>{1,2,3,4,5,6,7}</code>, <code>n=7</code>.</li>
  </ul>
  
  <blockquote>
    <p>And expected o/p was <code>3</code></p>
  </blockquote>