Timer is Running

Min distance between two given nodes of a Binary Tree
Submissions: 21443   Accuracy:


  Difficulty: Medium   Marks: 4
Associated Course(s):   Amazon SDE Test Series

Given a binary tree and two node values your task is to find the minimum distance between them.

First line of input contains the number of test cases T. For each test case, there will be only a two lines of input first of which is a string representing the tree as described below: 

  1. The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.

  2. For example:

For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
The next line contains two integers denoting two nodes a and b.

The function should return min distance between two node values.

Your Task:
You don't need to read input or print anything. Your task is to complete the function findDist() which takes the root node of the Tree and the two node values as inputs and returns the minimum distance between the nodes represented by the two given node values.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).

1 <= T <= 100
1 <= Number of nodes <= 104
1 <= Data of a node <= 105


1 2 3
2 3 


Test Case 1: The tree formed is:
     /   \ 
   2     3
We need the distance between 2 and 3. Being at node 2, we need to take two steps ahead in order to reach node 3. The path followed will be: 2 -> 1 -> 3. Hence, the result is 2. 



Contributor: Amit Khandelwal
Author: Shubham Joshi 1



to report an issue on this page.