Tree traversal: Difference between revisions

Revision as of 00:45, 5 November 2005

Revision as of 21:10, 11 November 2005

Line 15:

</pre>

This [[recursive algorithm]] prints the values in the tree in '''pre-order'''. In pre-order, each node is visited before any of its children. Similarly, if the print statement were last, each node would be visited after all of its children, and the values would be printed in '''post-order'''. In both cases, values in the left subtree are printed before values in the right subtree.

<pre>