Is there a way to print out numbers for pre-order, post-order and in-order traversals of trees using just recursion and a number. The trees are binary and n is the number of nodes from the parent to al children. Can anyone help me write the function to print the numbers in their orderly fashion in any programming language?
TimTheCoder
16
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.