DSA · Theory

Types of Binary Trees

← All stacks

Theory

297/810

Types of Binary Trees

Types of Binary Trees is simple if you keep it on paper. Zara uses it for folder on disk in a file explorer.

Types of Binary Trees on the board — left < root < right. Then say what folder on disk looks like after.

Types of Binary Trees exists so Zara can keep folder on disk correct in a file explorer.

Zara ships Types of Binary Trees in a file explorer. That is the use case worth saying.

Types of Binary Trees trap — unbalanced BST becoming a list. Zara loses marks for that every viva.

After Types of Binary Trees, Zara should still remember unbalanced BST becoming a list.

Close Types of Binary Trees with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

For Types of Binary Trees: definition + a file explorer + one failure.

Example

# Types of Binary Trees
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)

Types of Binary Trees: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTypes of Binary Trees — Zara uses it for folder on disk in a file explorer.
RuleTypes of Binary Trees → left < root < right.
RememberTypes of Binary Trees + a dry-run table (a file explorer).
UseTypes of Binary Trees in a file explorer (folder on disk).
TrapTypes of Binary Trees — unbalanced BST becoming a list.
ExTypes of Binary Trees → folder on disk.

DSA · Theory

Types of Binary Trees

← All stacks

Theory

297/810

Types of Binary Trees

Types of Binary Trees is simple if you keep it on paper. Zara uses it for folder on disk in a file explorer.

Types of Binary Trees on the board — left < root < right. Then say what folder on disk looks like after.

Types of Binary Trees exists so Zara can keep folder on disk correct in a file explorer.

Zara ships Types of Binary Trees in a file explorer. That is the use case worth saying.

Types of Binary Trees trap — unbalanced BST becoming a list. Zara loses marks for that every viva.

After Types of Binary Trees, Zara should still remember unbalanced BST becoming a list.

Close Types of Binary Trees with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

For Types of Binary Trees: definition + a file explorer + one failure.

Example

# Types of Binary Trees
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)

Types of Binary Trees: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTypes of Binary Trees — Zara uses it for folder on disk in a file explorer.
RuleTypes of Binary Trees → left < root < right.
RememberTypes of Binary Trees + a dry-run table (a file explorer).
UseTypes of Binary Trees in a file explorer (folder on disk).
TrapTypes of Binary Trees — unbalanced BST becoming a list.
ExTypes of Binary Trees → folder on disk.

Types of Binary Trees

Example

Short notes

Questions

Types of Binary Trees

Example

Short notes

Questions