DSA · Theory

Properties of tree

← All stacks

Theory

462/810

Properties of tree

Don’t start Properties of tree with jargon. Start with folder on disk. That is the whole point.

For Properties of tree, a dry-run table is in play. Don’t blame it until you have traced folder on disk.

Properties of tree exists so Neha can keep folder on disk correct in a file explorer.

Properties of tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Don’t do this with Properties of tree — unbalanced BST becoming a list. Interviewers spot it in ten seconds.

After Properties of tree, Neha should still remember unbalanced BST becoming a list.

One breath for Properties of tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Properties of tree in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Properties of 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)

Properties of tree: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefProperties of tree — Neha uses it for folder on disk in a file explorer.
RuleProperties of tree → left < root < right.
RememberProperties of tree + a dry-run table (a file explorer).
UseProperties of tree in a file explorer (folder on disk).
TrapProperties of tree — unbalanced BST becoming a list.
ExProperties of tree → folder on disk.

DSA · Theory

Properties of tree

← All stacks

Theory

462/810

Properties of tree

Don’t start Properties of tree with jargon. Start with folder on disk. That is the whole point.

For Properties of tree, a dry-run table is in play. Don’t blame it until you have traced folder on disk.

Properties of tree exists so Neha can keep folder on disk correct in a file explorer.

Properties of tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Don’t do this with Properties of tree — unbalanced BST becoming a list. Interviewers spot it in ten seconds.

After Properties of tree, Neha should still remember unbalanced BST becoming a list.

One breath for Properties of tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Properties of tree in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

# Properties of 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)

Properties of tree: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefProperties of tree — Neha uses it for folder on disk in a file explorer.
RuleProperties of tree → left < root < right.
RememberProperties of tree + a dry-run table (a file explorer).
UseProperties of tree in a file explorer (folder on disk).
TrapProperties of tree — unbalanced BST becoming a list.
ExProperties of tree → folder on disk.

Properties of tree

Example

Short notes

Questions

Properties of tree

Example

Short notes

Questions