Showing:
Handle Score
@Ibrahim Nash 6420
@mb1973 5642
@Quandray 5233
@akhayrutdinov 5111
@saiujwal13083 4610
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3413
Level of a Node in Binary Tree
Easy Accuracy: 50.02% Submissions: 14540 Points: 2

Given a Binary Tree and a target key you need to find the level of target key in the given Binary Tree.

           3
/   \
2     5
/   \
1     4
Key: 4
Level: 3  

Note: if no such key exists then return 0.

Example 1:

Input:
1
/   \
2     3
target = 4
Output: 0



Example 2:

Input:
3
/   \
2     5
/   \
1     4
target = 4
Output: 2


You don't have to take input. Just complete the function getLevel() that takes a node and a target as parameters and returns the level of the target value.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(H).
Note: H is the height of the tree and this space is used implicitly for recursion stack.

Constraints:
1 <= Number of nodes<= 105
1 <= Data of a node<= 105
1 <= Target <= 105