This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Medium

Find The Distance From Root To Given Node of a Binary Tree.

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

What does Distance mean: It means a number of 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

Run This Code

Code:

Output:

Distance from root to 45 is : 3

---

---

Also Read:

- Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium
- Print all steps to convert one string to another string Medium
- Reverse a Linked List in groups of given size 'K' Medium
- Find the Loop in a Linked list, find its length and Break the Loop Medium
- Print the Vertical Sum in binary Tree . Medium
- Find a peak element in a Given Array Beginner
- Merge K Sorted Arrays Hard
- Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium

---