Revision as of 21:10, 11 November 2005 edit Neurodivergent (talk \| contribs) 1,281 edits →Traversal methods: wiki link recursive algorithm ← Previous edit		Revision as of 07:23, 28 November 2005 edit undo DavidCary (talk \| contribs) Extended confirmed users 7,223 edits merge? Next edit →
Line 1: {{Tree search algorithm}} {{merge\|Tree search algorithm}} 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 classified by the order in which the nodes are visited.

Tree traversal: Difference between revisions