- A form of graph traversal that refers to the process of visiting (e.g., retrieving, updating, or deleting) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited, as with depth-first search and breadth-first search. ← Wikipedia
- Related terms: Tree · Breadth-first search · Root node · Document Object Model
- Previous term: Tree shaking
- Next term: Triadic colors
- Random term: Project management triangle (webglossary.info/random 🎲)