New update is available. Click here to update.

Height of the Binary Tree From Inorder and Level Order Traversal

MEDIUM

10 mins

104 upvotes

Trees

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Height of the Binary Tree From Inorder and Level Order Traversal

Contributed by

Ekansh Saxena

Medium

0/80

10 mins

90 %

104 upvotes

+4 more

Problem Statement

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.

Detailed explanation ( Input/output format, Notes, Images )

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

Sample Input 1:

Sample Output 1:

Explanation for Sample 1:

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.

Sample Input 2:

1
7
7 4 2 1 5 3 6
1 2 3 4 5 6 7

Sample Output 2:

Autocomplete

Console