Index Tree Lab

Build, inspect, and step through balanced index trees with a canvas-first workspace.

Structure

Minimum degree

Insert value

Search value

Delete value

Random count

Tree workspace

Tree is empty - insert a value to get started.

1 / 1

100%

Tree is empty - insert a value to begin

Speed

Tree stats

0

Total keys

0

Tree height

3

Min degree (t)

5

Max keys / node

B-tree

Values can live in internal and leaf nodes with balanced multi-way branching.

Algorithm reference

INSERT

DELETE

SEARCH

INSERT(root, k)  if root.n == 2t-1      split root -> new root  INSERT-NONFULL(root, k)INSERT-NONFULL(x, k)  if x.leaf      insert k into x.keys  else      find child i for k      if x.c[i] is full          SPLIT-CHILD(x, i)      INSERT-NONFULL(x.c[i], k)

Visual states

Visiting nodeSplit - median promotedSplit - left halfSplit - right halfKey insertedKey deletedMergeBorrow from siblingPredecessor / successor swap