Construct · 1 fields · 1 citations

red-black tree: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
red-blacktree1 CONSTRUCTRed-black treeGUIBAS · ALGORITHMS AND DATA

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

Algorithms and data structures

a balanced binary search tree whose nodes carry one color bit under rules that keep every root-to-leaf path within a factor of two in length.

In algorithms and data structures, red-black tree refers to a balanced binary search tree whose nodes carry one color bit under rules that keep every root-to-leaf path within a factor of two in length. This meaning comes from Guibas (1978) in 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).[1]

Unit
Recovery means
Measured by

Next

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

See how red-black tree 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

carry1 fields · 1 citationsanchor · a standalone constructcolor4 fields · 5 citationsjingle · one word, four constructsfactor3 fields · 4 citationsjingle · one word, three constructs

References

  1. Guibas, L. J., & Sedgewick, R. (1978). A dichromatic framework for balanced trees. 19th Annual Symposium on Foundations of Computer Science (sfcs 1978). https://doi.org/10.1109/sfcs.1978.3

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