Algorithm Search⌘K

Data structureadvanced

Scapegoat tree

Also called scapegoat tree.

A BST without per-node balance data that rebuilds a subtree rooted at a scapegoat when it becomes too unbalanced; O(log n) amortized.

A BST without per-node balance data that rebuilds a subtree rooted at a scapegoat when it becomes too unbalanced; O(log n) amortized.

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
  • The abstract type
  • one source with a locator