Given a binary tree and two node values your task is to find the minimum distance between them.
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.
The function should return min distance between two node values .
1 <=T<= 30
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
1 2 L 1 3 R
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.
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.