Algorithm Search⌘K

Conceptcore

Red-black and 2-3-4 tree correspondence

Also called red-black to 2-3-4 correspondence.

Each red-black tree corresponds to a 2-3-4 tree by merging red children into their parent, which explains its rebalancing rules.

Each red-black tree corresponds to a 2-3-4 tree by merging red children into their parent, which explains its rebalancing rules.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • one source with a locator