Tree traversal: Difference between revisions

Revision as of 11:02, 22 February 2023

Revision as of 23:05, 27 February 2023

Line 2:

{{Redirect-distinguish|Tree search|Search tree}}

{{refimprove|date=May 2009}}

{{graph search algorithm}}

In [[computer science]], '''tree traversal''' (also known as '''tree search''' and '''walking the tree''') is a form of [[graph traversal]] and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a [[Tree (data structure)|tree data structure]], exactly once. Such traversals are classified 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 as well.

Line 327 ⟶ 326:

* [http://rosettacode.org/wiki/Tree_traversal See tree traversal implemented in various programming language] on [[Rosetta Code]]

* [http://www.perlmonks.org/?node_id=600456 Tree traversal without recursion]

{{Graph traversal algorithms}}

{{DEFAULTSORT:Tree Traversal}}