DSA · Theory

Splay Tree

Theory

129/810

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

Keep Splay Tree small. Zara should finish folder on disk in a few lines, not a 40-line dump.

Skip Splay Tree and unbalanced BST becoming a list shows up in a file explorer.

Zara ships Splay Tree in a file explorer. That is the use case worth saying.

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

Splay Tree is not a lonely heading. Zara ties it to folder on disk.

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

Exam tip

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

# Splay 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)

Splay Tree: dry-run [4, 1, 3]. Say the list after one step.