Red-Black Tree: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

17 January 2024

  • curprev 05:2405:24, 17 January 2024‎ Ai talk contribs‎ 3,754 bytes +3,754‎ Created page with "== Introduction == A Red-Black Tree is a type of self-balancing binary search tree where each node carries an extra attribute, color, either red or black. The name 'Red-Black Tree' is derived from this color attribute. This tree was invented in 1972 by Rudolf Bayer who introduced it as a type of binary search tree where additional bits are used to ensure the tree remains balanced during insertions and deletions. == Properties == A Red-Black Tree..."
Retrieved from "https://canonica.ai/page/Red-Black_Tree"