For the below example tree, all root-to-leaf paths are:
10 –> 8 –> 3
10 –> 8 –> 5
10 –> 2 –> 2
Use a path array path to store current root to leaf path. Traverse from root to all leaves in top-down fashion. While traversing, store data of all nodes in current path in array path. When we reach a leaf node, print the path array.
10 8 3 10 8 5 10 2 2
Time Complexity: O(n2) where n is number of nodes.
Please write comments if you find any bug in above codes/algorithms, or find other ways to solve the same problem.
- Print all k-sum paths in a binary tree
- Print all the paths from root, with a specified sum in Binary tree
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- Count all k-sum paths in a Binary Tree
- Root to leaf paths having equal lengths in a Binary Tree
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Print Binary Tree in 2-Dimensions
- Print Right View of a Binary Tree
- Print a Binary Tree in Vertical Order | Set 1
- Print Nodes in Top View of Binary Tree
- Print all nodes in a binary tree having K leaves
- Print all full nodes in a Binary Tree
- Print nodes in top view of Binary Tree | Set 2
- Print Binary Search Tree in Min Max Fashion
- Print all internal nodes of a Binary tree