Tree traversal is the systematic process of visiting nodes in a tree data structure. Common traversal strategies include depth-first and breadth-first methods, which support search, reasoning, parsing, and decision-tree operations.
(Also tree search.) A form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited.