This post is completed by 1 user Login To Mark Completed

0

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

Medium

Print Paths from root to all leaf nodes in a binary tree.

Objective: Given a binary tree, Print paths from root to all leaf nodes

Input: A binary tree

Example:

Approach:

• Do the preOrder traversal.
• Store the current node in an array, say Path[], and maintain the length say pathLength.
• check if you are at the leaf node (both the left and right child of the parent will be null).
• If not then keep traversing by making recursive calls to root.left and root.right. Pass the path and pathLen as a parameter so that at each level have its own copy of the path and its length.
• If you hit the leaf node then print the array.
• See Code

Run This Code

Code:

1 2 4 7
1 3 6 8
1 3 6 9

---

---

Also Read:

- Binary Tree-Inorder Traversal - Non Recursive Approach Beginner
- Backtracking - Rat In A Maze Puzzle Hard
- Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Medium
- Binary Search Beginner
- Find the Loop in a Linked list, find its length and Break the Loop Medium
- Print All Possible Subsets with Sum equal to a given Number Hard
- Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard
- Print the Binary Tree in Vertical Order Path. Medium

---