Given a binary tree and data value of two of its nodes. Find the number of turns needed to reach from one node to another in the given binary tree.
Example 1:
Input:
Tree =
1
/ \
2 3
/ \ / \
4 5 6 7
/ / \
8 9 10 first node = 5
second node = 10Output: 4Explanation:
Turns will be at 2, 1, 3, 6.
Example 2:
Input:
Tree =
1
/ \
2 3
/ \ / \
4 5 6 7
/ / \
8 9 10 first node = 1
second node = 4 Output: -1Explanation: No turn is required since
they are in a straight line.
Your Task:
You don't need to read input or print anything. Complete the function NumberOFTurns() which takes root node and data value of 2 nodes as input parameters and returns the number of turns required to navigate between them. If the two nodes are in a straight line, ie- the path does not involve any turns, return -1.
Expected Time Complexity: O(N) Expected Auxiliary Space: O(Height of Tree)
Reset the IDE using the second button on the top right corner.
Avoid using static/global variables in your code as your code is tested
against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases does not guarantee the correctness of code.
On submission, your code is tested against multiple test cases consisting of all
possible corner cases and stress constraints.
You can access the hints to get an idea about what is expected of you as well as
the final solution code.
You can view the solutions submitted by other users from the submission tab.
Here is some troubleshooting advice for contest problems
Make sure you are not using ad-blockers.
Disable browser extensions.
We recommend using latest version of your browser for best experience.
Avoid using static/global variables in coding problems as your code is tested
against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases in coding problems does not guarantee the
correctness of code. On submission, your code is tested against multiple test cases
consisting of all possible corner cases and stress constraints.
POTD
POTD
