Tree traversal
From Wikipedia, the free encyclopedia
This article needs additional for . (May 2009)
and tree search algorithms
Listings
Related topics
- Tree traversal
In , tree traversal refers to the process of visiting (examining and/or updating) each node in a , exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a , but they may be generalized to other trees as well.