Algorithm Search⌘K

Data structurecore

Priority search tree

Also called McCreight priority search tree.

Tree that is both a heap and a search tree on the points, answering three-sided range queries in O(log n + k) time.

Tree that is both a heap and a search tree on the points, answering three-sided range queries in O(log n + k) time.

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

Tag 2MY7Y5 Edit this page History Report an error