DSA · Theory

Tree of Space - Locking and Unlocking N-Ary Tree

Theory

542/810

Tree of Space - Locking and Unlocking N-Ary Tree

Don’t start Tree of Space - Locking and Unlocking N-Ary Tree with jargon. Start with folder on disk. That is the whole point.

Tree of Space - Locking and Unlocking N-Ary Tree on the board: left < root < right. Then say what folder on disk looks like after.

Without Tree of Space - Locking and Unlocking N-Ary Tree, a file explorer gets messy and folder on disk is hard to trust.

Tree of Space - Locking and Unlocking N-Ary Tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Tree of Space - Locking and Unlocking N-Ary Tree trap: unbalanced BST becoming a list. Neha loses marks for that every viva.

Place Tree of Space - Locking and Unlocking N-Ary Tree next to nearby DSA work — left < root < right is the link.

Viva for Tree of Space - Locking and Unlocking N-Ary Tree: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Board: folder on disk. Dry-run Tree of Space - Locking and Unlocking N-Ary Tree. Name the trap: unbalanced BST becoming a list.

Example

# Tree of Space - Locking and Unlocking N-Ary 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)

Tree of Space - Locking and Unlocking N-Ary Tree: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTree of Space - Locking and Unlocking N-Ary Tree — Neha uses it for folder on disk in a file explorer.
RuleTree of Space - Locking and Unlocking N-Ary Tree → left < root < right.
RememberTree of Space - Locking and Unlocking N-Ary Tree + Big-O (a file explorer).
UseTree of Space - Locking and Unlocking N-Ary Tree in a file explorer (folder on disk).
TrapTree of Space - Locking and Unlocking N-Ary Tree — unbalanced BST becoming a list.
ExTree of Space - Locking and Unlocking N-Ary Tree → folder on disk.

DSA · Theory

Tree of Space - Locking and Unlocking N-Ary Tree

← All stacks

Theory

542/810

Tree of Space - Locking and Unlocking N-Ary Tree

Don’t start Tree of Space - Locking and Unlocking N-Ary Tree with jargon. Start with folder on disk. That is the whole point.

Tree of Space - Locking and Unlocking N-Ary Tree on the board: left < root < right. Then say what folder on disk looks like after.

Without Tree of Space - Locking and Unlocking N-Ary Tree, a file explorer gets messy and folder on disk is hard to trust.

Tree of Space - Locking and Unlocking N-Ary Tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Tree of Space - Locking and Unlocking N-Ary Tree trap: unbalanced BST becoming a list. Neha loses marks for that every viva.

Place Tree of Space - Locking and Unlocking N-Ary Tree next to nearby DSA work — left < root < right is the link.

Viva for Tree of Space - Locking and Unlocking N-Ary Tree: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Board: folder on disk. Dry-run Tree of Space - Locking and Unlocking N-Ary Tree. Name the trap: unbalanced BST becoming a list.

Example

# Tree of Space - Locking and Unlocking N-Ary 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)

Tree of Space - Locking and Unlocking N-Ary Tree: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTree of Space - Locking and Unlocking N-Ary Tree — Neha uses it for folder on disk in a file explorer.
RuleTree of Space - Locking and Unlocking N-Ary Tree → left < root < right.
RememberTree of Space - Locking and Unlocking N-Ary Tree + Big-O (a file explorer).
UseTree of Space - Locking and Unlocking N-Ary Tree in a file explorer (folder on disk).
TrapTree of Space - Locking and Unlocking N-Ary Tree — unbalanced BST becoming a list.
ExTree of Space - Locking and Unlocking N-Ary Tree → folder on disk.

Tree of Space - Locking and Unlocking N-Ary Tree

Example

Short notes

Questions

Tree of Space - Locking and Unlocking N-Ary Tree

Example

Short notes

Questions