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. Such traversals are classified by the order in which the nodes are visited. Depth-first Traversals: Pre-order, In-order, Post-order Please see the implementations here. |
Foundations > Algorithms >