Tree traversal

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, exactly once. Such traversals are classified by the order in which the nodes are visited.

Extends: Trees (data structures), [Articles with example pseudocode](https://wikipedia.org.ai/Articles with example pseudocode), [Graph algorithms](https://wikipedia.org.ai/Graph algorithms), Recursion, [Iteration in programming](https://wikipedia.org.ai/Iteration in programming)