DSA · Theory

Red-black tree

Theory

34/810

Asha only reaches for Red-black tree when folder on disk has to stay correct in a file explorer.

Do Red-black tree once by hand. left < root < right. Change one input. Say the new result out loud.

Red-black tree exists so Asha can keep folder on disk correct in a file explorer.

Red-black tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

If folder on disk breaks under Red-black tree, check unbalanced BST becoming a list first.

After Red-black tree, Asha should still remember unbalanced BST becoming a list.

One breath for Red-black tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

For Red-black tree: definition + a file explorer + one failure.

# Red-black 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)

Red-black tree: dry-run [4, 1, 3]. Say the list after one step.