Write the shortest code that traverses a tree, depth-first.
Any programmatical structure found in your language of choice: lists, tuples, queues etc.
A list of "names" of the nodes in correct order as shown in Depth-first search article at Wikipedia.
A node should be able to contain an infinite number of child nodes.
Also, you're not required to actually print the result, just returning the correct result with the ability to use it in your program will do; I didn't really print mine below in my answer, the function simply returned a list.