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)
