DSA · Theory

Tango Tree Data Structure

← All stacks

Theory

406/810

Tango Tree Data Structure

Tango Tree Data Structure is simple if you keep it on paper. Sara uses it for folder on disk in a file explorer.

Tango Tree Data Structure on the board — left < root < right. Then say what folder on disk looks like after.

Without Tango Tree Data Structure, a file explorer gets messy and folder on disk is hard to trust.

Tango Tree Data Structure shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Tango Tree Data Structure trap — unbalanced BST becoming a list. Sara loses marks for that every viva.

After Tango Tree Data Structure, Sara should still remember unbalanced BST becoming a list.

One breath for Tango Tree Data Structure, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Tango Tree Data Structure in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Tango Tree Data Structure
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)

Tango Tree Data Structure: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTango Tree Data Structure — Sara uses it for folder on disk in a file explorer.
RuleTango Tree Data Structure → left < root < right.
RememberTango Tree Data Structure + a dry-run table (a file explorer).
UseTango Tree Data Structure in a file explorer (folder on disk).
TrapTango Tree Data Structure — unbalanced BST becoming a list.
ExTango Tree Data Structure → folder on disk.

DSA · Theory

Tango Tree Data Structure

← All stacks

Theory

406/810

Tango Tree Data Structure

Tango Tree Data Structure is simple if you keep it on paper. Sara uses it for folder on disk in a file explorer.

Tango Tree Data Structure on the board — left < root < right. Then say what folder on disk looks like after.

Without Tango Tree Data Structure, a file explorer gets messy and folder on disk is hard to trust.

Tango Tree Data Structure shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Tango Tree Data Structure trap — unbalanced BST becoming a list. Sara loses marks for that every viva.

After Tango Tree Data Structure, Sara should still remember unbalanced BST becoming a list.

One breath for Tango Tree Data Structure, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Tango Tree Data Structure in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Tango Tree Data Structure
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)

Tango Tree Data Structure: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefTango Tree Data Structure — Sara uses it for folder on disk in a file explorer.
RuleTango Tree Data Structure → left < root < right.
RememberTango Tree Data Structure + a dry-run table (a file explorer).
UseTango Tree Data Structure in a file explorer (folder on disk).
TrapTango Tree Data Structure — unbalanced BST becoming a list.
ExTango Tree Data Structure → folder on disk.

Tango Tree Data Structure

Example

Short notes

Questions

Tango Tree Data Structure

Example

Short notes

Questions