Tree - (Traversal|Search)


In computer science, tree traversal (also known as tree search) 1) 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.

Tree traversal is also called:

  • walking a tree,
  • or visiting a tree.

Traversal means stopping at every node to do something.


How a tree is traversed is called the order.

For example, see Tree - Order

Powered by ComboStrap