DSA · Theory

B+ Tree

Theory

33/810

Don’t start B+ Tree (plus) with jargon. Start with folder on disk. That is the whole point.

For B+ Tree (plus), a dry-run table is in play. Don’t blame it until you have traced folder on disk.

B+ Tree (plus) exists so Kabir can keep folder on disk correct in a file explorer.

Kabir ships B+ Tree (plus) in a file explorer. That is the use case worth saying.

If folder on disk breaks under B+ Tree (plus), check unbalanced BST becoming a list first.

Place B+ Tree (plus) next to nearby DSA work — left < root < right is the link.

One breath for B+ Tree (plus), then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Board: folder on disk. Dry-run B+ Tree (plus). Name the trap: unbalanced BST becoming a list.

# B+ Tree
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

B+ Tree (plus) — Dry-run [4, 1, 3]. Say the list after one step.