Listing the paths to leaves in a tree

Question

I\'m trying to write a function that finds all of the paths to the leaves in a tree. For example, given a tree that looks like this:

           1
         /  \\
         


        

Answer 1

It's simple...These are the things that you need to have in mind :-

1. Recursively call the function
2. Within the function the traversal should be in the form of PreOrder ( root, left and then right)
3. Use an array within the recursive function and store the value of every node visited.
4. If the visited node is a leaf ... node--> left == NULL and node--> right == NULL. Then output the contents of the array.