Tree - (Traversal|Search)

> (Data|State) Management and Processing > (Data Type|Data Structure) > (Tree|Nested Set|Hierarchy) Data Structure

1 - About

In computer science, tree traversal (also known as tree search) refers to the process of visiting (examining and/or updating) each node in a tree data structure, exactly once, in a systematic way.

Tree traversal is a graph traversal.


3 - Order

How a tree is traversed is called the order.

For example, see Tree - Order

4 - Documentation / Reference