NIST

tree traversal

(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

More information

Demonstration of preorder, in-order, and postorder traversal on a binary tree.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 23 April 2007.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "tree traversal", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 23 April 2007. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/treeTraversal.html