78. Root-to-Node Distance in Binary Tree: How to Find

Objective: - Find The Distance From the Root To the Given Node of a binary tree.

What does Distance mean: It means several edges between two nodes.

Approach:

• This problem is similar to "Find Path From Root To Given Node"
• Make the following change to that
• Instead of returning the boolean value return the integer, nodes in the path will return the number = 1 + number returned by the previous node in the path.
• The final return will give you the number of nodes between the root and the given leaf node so the distance will be (edges)= number of nodes -1

Output:

Distance from root to 45 is : 3

Related Problems:

- Print Binary Tree Nodes in Zigzag Order: Spiral Traversal Pattern Hard
- Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium
- Construct a Binary Tree from Given Inorder and Depth-First-Search Hard
- Find the Height of a tree without using Recursion Medium