Construct · 1 fields · 1 citations

traverse: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
traverse1 CONSTRUCTTree traversalKNUTH · TREE WALK

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer science

Visiting every node of a structure in order

In computer science, a traversal is the process of visiting every node of a data structure such as a tree or graph exactly once in some defined order, for example pre-order, in-order, post-order, or breadth-first. Knuth's The Art of Computer Programming, Volume 1: Fundamental Algorithms formalised tree traversal and its orderings as a core operation on linked structures. The referent is an algorithmic walk over an abstract structure, counted in operations, with nothing in common with a surveyed route or a pleading tactic beyond the word.[1]

Unit
The order in which nodes are visited, and the cost of the walk (e.g., O(n))
Recovery means
Not applicable
Measured by
Analysed by the sequence of nodes visited and the time and space complexity of the walk

Next

Run it through the Collider, or take the citations with you.

See how traverse sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

tree3 fields · 4 citationsjingle · one word, three constructsclosed3 fields · 3 citationsjingle · one word, three constructsclosure6 fields · 6 citationsjingle · one word, six constructs

References

  1. Knuth, D. E. (1997). The art of computer programming: Vol. 1. Fundamental algorithms (3rd ed.). Addison-Wesley. ISBN 9780201896831

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct