(definition)
Definition: A technique for processing the nodes of a tree in some order.
Specialization (... is a kind of me.)
preorder traversal, in-order traversal, postorder traversal, level-order traversal.
Author: PEB
Demonstration of preorder, in-order, and postorder traversal on a binary tree.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 23 April 2007.
HTML page formatted Mon Apr 23 09:23:15 2007.
Cite this as:
Paul E. Black, "tree traversal", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 23 April 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/treeTraversal.html
