DSA · Theory

Tree Vertex Splitting

← All stacks

Theory

510/810

Tree Vertex Splitting

Don’t start Tree Vertex Splitting with jargon. Start with folder on disk. That is the whole point.

For Tree Vertex Splitting, a dry-run table is in play. Don’t blame it until you have traced folder on disk.

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

Vikram ships Tree Vertex Splitting in a file explorer. That is the use case worth saying.

If folder on disk breaks under Tree Vertex Splitting, check unbalanced BST becoming a list first.

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

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

Exam tip

Board: folder on disk. Dry-run Tree Vertex Splitting. Name the trap: unbalanced BST becoming a list.

Example

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

Short notes

DefTree Vertex Splitting — Vikram uses it for folder on disk in a file explorer.
RuleTree Vertex Splitting → left < root < right.
RememberTree Vertex Splitting + a dry-run table (a file explorer).
UseTree Vertex Splitting in a file explorer (folder on disk).
TrapTree Vertex Splitting — unbalanced BST becoming a list.
ExTree Vertex Splitting → folder on disk.

DSA · Theory

Tree Vertex Splitting

← All stacks

Theory

510/810

Tree Vertex Splitting

Don’t start Tree Vertex Splitting with jargon. Start with folder on disk. That is the whole point.

For Tree Vertex Splitting, a dry-run table is in play. Don’t blame it until you have traced folder on disk.

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

Vikram ships Tree Vertex Splitting in a file explorer. That is the use case worth saying.

If folder on disk breaks under Tree Vertex Splitting, check unbalanced BST becoming a list first.

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

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

Exam tip

Board: folder on disk. Dry-run Tree Vertex Splitting. Name the trap: unbalanced BST becoming a list.

Example

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

Short notes

DefTree Vertex Splitting — Vikram uses it for folder on disk in a file explorer.
RuleTree Vertex Splitting → left < root < right.
RememberTree Vertex Splitting + a dry-run table (a file explorer).
UseTree Vertex Splitting in a file explorer (folder on disk).
TrapTree Vertex Splitting — unbalanced BST becoming a list.
ExTree Vertex Splitting → folder on disk.

Tree Vertex Splitting

Example

Short notes

Questions

Tree Vertex Splitting

Example

Short notes

Questions