Algorithm Search⌘K

Data structurecore

Range tree

Also called 2D range tree, multi-level range tree.

Balanced search tree on one coordinate whose nodes store secondary trees on the remaining coordinates; O(log^d n) query time in d dimensions.

Balanced search tree on one coordinate whose nodes store secondary trees on the remaining coordinates; O(log^d n) query time in d dimensions.

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