Objective: – Find The Distance From Root To Given Node of a binary tree.
What does Distance means : It means number of edges between two nodes.
Approach:
- This problem is similar to “Find Path From Root To Given Node“
- Make the following change into that
- Instead of returning the boolean value return the integer, nodes in the path will return the number = 1 + number returned by pervious node in path .
- The final return will give you the number of nodes between root and the given leaf node so the distance will be (edges)= number of nodes -1
Complete Code:
Output :
Distance from root to 45 is : 3