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)