Algorithm Search⌘K

Data structurecore

B-tree

Also called Definition of B-trees, B-TREE-INSERT.

Balanced multiway search tree whose nodes hold many keys, designed to minimize disk accesses in large stored datasets.

Balanced multiway search tree whose nodes hold many keys, designed to minimize disk accesses in large stored datasets.

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 KEZ9RE Edit this page History Report an error