Definition: Process all nodes of a tree by recursively processing the left subtree, then processing the root, and finally the right subtree.
Generalization (I am a kind of ...)
tree traversal, depth-first search.
Aggregate parent (I am a part of or used in ...)
See also postorder traversal, preorder traversal, level-order traversal.
For instance, if the "processing" is just printing, a tree is printed as "(left subtree) root (right subtree)." Here is pseudocode for a binary tree:
if tree is null, return;
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 14 August 2008.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "in-order traversal", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 14 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/inorderTraversal.html