DSA · Theory

Handshaking Lemma and Interesting Tree Properties

Theory

384/810

Handshaking Lemma and Interesting Tree Properties

Handshaking Lemma and Interesting Tree Properties is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Handshaking Lemma and Interesting Tree Properties.

From the example next to this theory — Handshaking Lemma and Interesting Tree Properties: dry-run [4, 1, 3].

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Handshaking Lemma and Interesting Tree Properties? Then show left < root < right. Then name the trap.

Exam tip

What is Handshaking Lemma and Interesting Tree Properties? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

# Handshaking Lemma and Interesting Tree Properties
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)

Handshaking Lemma and Interesting Tree Properties: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefHandshaking Lemma and Interesting Tree Properties — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

DSA · Theory

Handshaking Lemma and Interesting Tree Properties

← All stacks

Theory

384/810

Handshaking Lemma and Interesting Tree Properties

Handshaking Lemma and Interesting Tree Properties is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Handshaking Lemma and Interesting Tree Properties.

From the example next to this theory — Handshaking Lemma and Interesting Tree Properties: dry-run [4, 1, 3].

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Handshaking Lemma and Interesting Tree Properties? Then show left < root < right. Then name the trap.

Exam tip

What is Handshaking Lemma and Interesting Tree Properties? Show this: left < root < right. Trap: unbalanced BST becoming a list.

Example

# Handshaking Lemma and Interesting Tree Properties
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)

Handshaking Lemma and Interesting Tree Properties: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefHandshaking Lemma and Interesting Tree Properties — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

Handshaking Lemma and Interesting Tree Properties

Example

Short notes

Questions

Handshaking Lemma and Interesting Tree Properties

Example

Short notes

Questions