DSA · Theory

Shortest path in a Binary Maze

Theory

793/810

Shortest path in a Binary Maze

If you can teach Shortest path in a Binary Maze using folder on disk, you know it. If you only know the heading, you don’t.

Shortest path in a Binary Maze on the board: left < root < right. Then say what folder on disk looks like after.

Without Shortest path in a Binary Maze, a file explorer gets messy and folder on disk is hard to trust.

Use Shortest path in a Binary Maze when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Shortest path in a Binary Maze trap — unbalanced BST becoming a list. Amit loses marks for that every viva.

Shortest path in a Binary Maze is not a lonely heading. Amit ties it to folder on disk.

Viva for Shortest path in a Binary Maze: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Say Shortest path in a Binary Maze in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Shortest path in a Binary Maze
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)

Shortest path in a Binary Maze: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefShortest path in a Binary Maze — Amit uses it for folder on disk in a file explorer.
RuleShortest path in a Binary Maze → left < root < right.
RememberShortest path in a Binary Maze + a dry-run table (a file explorer).
UseShortest path in a Binary Maze in a file explorer (folder on disk).
TrapShortest path in a Binary Maze — unbalanced BST becoming a list.
ExShortest path in a Binary Maze → folder on disk.

DSA · Theory

Shortest path in a Binary Maze

← All stacks

Theory

793/810

Shortest path in a Binary Maze

If you can teach Shortest path in a Binary Maze using folder on disk, you know it. If you only know the heading, you don’t.

Shortest path in a Binary Maze on the board: left < root < right. Then say what folder on disk looks like after.

Without Shortest path in a Binary Maze, a file explorer gets messy and folder on disk is hard to trust.

Use Shortest path in a Binary Maze when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Shortest path in a Binary Maze trap — unbalanced BST becoming a list. Amit loses marks for that every viva.

Shortest path in a Binary Maze is not a lonely heading. Amit ties it to folder on disk.

Viva for Shortest path in a Binary Maze: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Say Shortest path in a Binary Maze in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Shortest path in a Binary Maze
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)

Shortest path in a Binary Maze: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefShortest path in a Binary Maze — Amit uses it for folder on disk in a file explorer.
RuleShortest path in a Binary Maze → left < root < right.
RememberShortest path in a Binary Maze + a dry-run table (a file explorer).
UseShortest path in a Binary Maze in a file explorer (folder on disk).
TrapShortest path in a Binary Maze — unbalanced BST becoming a list.
ExShortest path in a Binary Maze → folder on disk.

Shortest path in a Binary Maze

Example

Short notes

Questions

Shortest path in a Binary Maze

Example

Short notes

Questions