DSA · Theory

B Tree Insertion

Theory

298/810

B Tree Insertion sits in a file explorer. Riya’s job is folder on disk. Write that first.

Do B Tree Insertion once by hand. left < root < right. Change one input. Say the new result out loud.

Without B Tree Insertion, a file explorer gets messy and folder on disk is hard to trust.

Use B Tree Insertion when folder on disk must stay clear. If a simpler DSA step works, use that instead.

B Tree Insertion miss — unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

Place B Tree Insertion next to nearby DSA work — left < root < right is the link.

One breath for B Tree Insertion, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say B Tree Insertion in one breath, then left < root < right, then unbalanced BST becoming a list.

# B Tree Insertion
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 Insertion: dry-run [4, 1, 3]. Say the list after one step.