Tree - (Traversal|Search)

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

data/type/tree/traversal.txt ยท Last modified: 2017/12/18 14:16 by gerardnico