Height of the Binary Tree From Inorder and Level Order Traversal

You have been given the Inorder Traversal and Level Order Traversal of a Binary Tree of integers. Your task is to calculate the height of the Binary tree without constructing it.

The height of the binary tree is the number of edges in the longest path from the root node to any leaf node in the tree. In case the tree has only one node, the height is taken to be 0.

Input Format:

The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows.

The first line of each test case contains an integer  ‘N’ denoting the number of nodes of the binary tree.

The second line of each test case contains ‘N’ single space-separated integers, denoting the Inorder traversal of the binary tree.

The third line of each test case contains ‘N’ single space-separated integers, denoting the Level Order traversal of the binary tree.

Output Format:

For each test case, print the height of the binary tree.

Output for every test case will be printed in a separate line.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 100
1 <= N <= 3000
1 <= inorder[i] <= N
1 <= levelOrder[i] <= N

Time Limit: 1 sec