Problem of the day
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.
For each test case, print the height of the binary tree.
Output for every test case will be printed in a separate line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= N <= 3000
1 <= inorder[i] <= N
1 <= levelOrder[i] <= N
Time Limit: 1 sec
1
5
4 2 5 1 3
1 2 3 4 5
2
The binary tree(rooted at node 1) represented by the above inorder and level order traversals is-
We can see that the height of the above binary tree is 2.
1
7
7 4 2 1 5 3 6
1 2 3 4 5 6 7
3