DSA · Theory

B+ Tree Deletion

Theory

309/810

If you can teach B+ Tree Deletion using folder on disk, you know it. If you only know the heading, you don’t.

For B+ Tree Deletion, Big-O is in play. Don’t blame it until you have traced folder on disk.

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

B+ Tree Deletion shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

B+ Tree Deletion trap — unbalanced BST becoming a list. Priya loses marks for that every viva.

B+ Tree Deletion is not a lonely heading. Priya ties it to folder on disk.

Close B+ Tree Deletion with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

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

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