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

**Input:**

The task is to complete the fuction **findDist** which takes 3 argument, the root of the Binary Tree and two node values a and b .

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should return min distance between two node values .

**Constraints:**

1 <=T<= 30

1 <=Number of nodes<= 100

1 <=Data of a node<= 1000

**Example:
Input**

1

2

1 2 L 1 3 R

2 3

2

In above example there is one test case which represent a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 2 and right child of 1 is 3.

Author: Shubham Joshi 1

11620078 | 164 |

RohitBattu | 127 |

Maninder07 | 126 |

blackshadows | 120 |

Rags Bhasin | 110 |

blackshadows | 880 |

xmyqsh | 565 |

mb1973 | 439 |

aman19 | 402 |

shubhamjain237 | 376 |

akhayrutdinov | 5014 |

Ibrahim Nash | 4899 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3384 |

Login to report an issue on this page.