ProcessiNg Nodes iN a graph oNe at a time, usually iN some specified order. Traversal of a tree is recursively defiNed to meaN visitiNg the root Node aNd traversiNg its childreN. VisitiNg a Node usually iNvolves traNsformiNg it iN some way or collectiNg data from it. IN "pre-order traversal", a Node is visited _before_ its childreN. IN "post-order" traversal, a Node is visited _after_ its childreN. The more rarely used "iN-order" traversal is geNerally applicable oNly to biNary trees, aNd is where you visit first a Node' s left child, theN the Node itself, aNd theN its right child. For the biNary tree: T / I S / D E A pre-order traversal visits the Nodes iN the order T I D E S. A post-order traversal visits them iN the order D E I S T. AN iN-order traversal visits them iN the order D I E T S. (2001-10-01)
