Tree traversal: Difference between revisions

Revision as of 22:10, 12 March 2005

Revision as of 23:34, 12 March 2005

Line 1:

In [[computer science]], '''tree traversal''' is the process of visiting each node in a [[tree data structure]]. Tree traversal, also called '''walking the tree''', provides for sequential processing of each node in what is, by nature, a non-sequential data structure.

Such traversals are characterisedclassified by the order in which the nodes are visited.

The following algorithms are described for a [[binary tree]], but they may be generalized to other trees.