DSA · Theory

Minimum Spanning Tree

← All stacks

Theory

40/810

Minimum Spanning Tree

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

For Minimum Spanning Tree, time vs memory is in play. Don’t blame it until you have traced folder on disk.

Minimum Spanning Tree exists so Neha can keep folder on disk correct in a file explorer.

Neha ships Minimum Spanning Tree in a file explorer. That is the use case worth saying.

Don’t do this with Minimum Spanning Tree: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

Minimum Spanning Tree is not a lonely heading. Neha ties it to folder on disk.

One breath for Minimum Spanning Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

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

Example

# Minimum Spanning 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)

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

Short notes

DefMinimum Spanning Tree — Neha uses it for folder on disk in a file explorer.
RuleMinimum Spanning Tree → left < root < right.
RememberMinimum Spanning Tree + time vs memory (a file explorer).
UseMinimum Spanning Tree in a file explorer (folder on disk).
TrapMinimum Spanning Tree — unbalanced BST becoming a list.
ExMinimum Spanning Tree → folder on disk.

DSA · Theory

Minimum Spanning Tree

← All stacks

Theory

40/810

Minimum Spanning Tree

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

For Minimum Spanning Tree, time vs memory is in play. Don’t blame it until you have traced folder on disk.

Minimum Spanning Tree exists so Neha can keep folder on disk correct in a file explorer.

Neha ships Minimum Spanning Tree in a file explorer. That is the use case worth saying.

Don’t do this with Minimum Spanning Tree: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

Minimum Spanning Tree is not a lonely heading. Neha ties it to folder on disk.

One breath for Minimum Spanning Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

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

Example

# Minimum Spanning 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)

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

Short notes

DefMinimum Spanning Tree — Neha uses it for folder on disk in a file explorer.
RuleMinimum Spanning Tree → left < root < right.
RememberMinimum Spanning Tree + time vs memory (a file explorer).
UseMinimum Spanning Tree in a file explorer (folder on disk).
TrapMinimum Spanning Tree — unbalanced BST becoming a list.
ExMinimum Spanning Tree → folder on disk.

Minimum Spanning Tree

Example

Short notes

Questions

Minimum Spanning Tree

Example

Short notes

Questions