> (Data|State) Management and Processing
> (Data Type|Data Structure)
> (Tree|Nested Set|Hierarchy) Data Structure
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.
How a tree is traversed is called the order.
For example, see Tree - Order