Construct · 1 fields · 1 citations

leaf: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaningtreecompare the meanings
How to read this

Every construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to leaf is tree.

Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.

leaf1 CONSTRUCTLeaf nodeKNUTH · TERMINAL NODE

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

Computer science

A leaf node in a tree

In a rooted tree data structure, a node with no children: also called a terminal or external node, a leaf sits at the end of a branch and holds no further subtree below it. Knuth's 1997 The art of computer programming, Volume 1 set out the standard terminology of trees, in which every node but the root has one parent and the nodes with no descendants are the leaves. The referent is an abstract position in a hierarchy, defined only by having nothing beneath it, and it borrows the word from the plant while sharing none of its substance, nor that of a book's sheet or a sheet of gold.[1]

Unit
A node with no children in a rooted tree
Recovery means
Not applicable
Measured by
Identified by having no descendants, and counted among a tree's nodes by depth and degree

Next

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

See how leaf 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 constructsnode2 fields · 4 citationsjingle · one word, two constructsroot3 fields · 5 citationsjingle · one word, three constructs

References

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

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