DSA · Theory

2-3 Trees (Search, Insertion, and Deletion)

Theory

228/810

2-3 Trees (Search, Insertion, and Deletion)

2-3 Trees (Search, Insertion, and Deletion) is a DSA topic. In plain words you use it for find roll 12 in a sorted list. Don’t start with a slogan — start with that picture.

Smallest example: linear vs binary. Type it, run it, and say what you see. If you can do that from memory, you know 2-3 Trees (Search, Insertion, and Deletion).

From the example next to this theory — 2-3 Trees (Search, Insertion, and Deletion): dry-run [4, 1, 3].

Trap — binary search on unsorted data. Fix that before you talk about advanced DSA.

Viva — what is 2-3 Trees (Search, Insertion, and Deletion)? Then show linear vs binary. Then name the trap.

Exam tip

What is 2-3 Trees (Search, Insertion, and Deletion)? Show this: linear vs binary. Trap: binary search on unsorted data.

Example

# 2-3 Trees (Search, Insertion, and Deletion)
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)

2-3 Trees (Search, Insertion, and Deletion): dry-run [4, 1, 3]. Say the list after one step.

Short notes

Def2-3 Trees (Search, Insertion, and Deletion) — find roll 12 in a sorted list.
Rulelinear vs binary
Trapbinary search on unsorted data
Usea sorted list

DSA · Theory

2-3 Trees (Search, Insertion, and Deletion)

← All stacks

Theory

228/810

2-3 Trees (Search, Insertion, and Deletion)

2-3 Trees (Search, Insertion, and Deletion) is a DSA topic. In plain words you use it for find roll 12 in a sorted list. Don’t start with a slogan — start with that picture.

Smallest example: linear vs binary. Type it, run it, and say what you see. If you can do that from memory, you know 2-3 Trees (Search, Insertion, and Deletion).

From the example next to this theory — 2-3 Trees (Search, Insertion, and Deletion): dry-run [4, 1, 3].

Trap — binary search on unsorted data. Fix that before you talk about advanced DSA.

Viva — what is 2-3 Trees (Search, Insertion, and Deletion)? Then show linear vs binary. Then name the trap.

Exam tip

What is 2-3 Trees (Search, Insertion, and Deletion)? Show this: linear vs binary. Trap: binary search on unsorted data.

Example

# 2-3 Trees (Search, Insertion, and Deletion)
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)

2-3 Trees (Search, Insertion, and Deletion): dry-run [4, 1, 3]. Say the list after one step.

Short notes

Def2-3 Trees (Search, Insertion, and Deletion) — find roll 12 in a sorted list.
Rulelinear vs binary
Trapbinary search on unsorted data
Usea sorted list

2-3 Trees (Search, Insertion, and Deletion)

Example

Short notes

Questions

2-3 Trees (Search, Insertion, and Deletion)

Example

Short notes

Questions