Simple DFS with keeping track of visited nodes (stack) is enough to easily solve this problem.
On Nov 7, 8:34 pm, neeraj agarwal <[email protected]> wrote: > write an algorithm to print the path from root to every leaf node in binary > tree. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
