ViewTube

Structural Measures — a focused lesson in the Binary Trees series. A clear, visual explanation with a memory diagram and real C ...

The Binary Trees abstract data type: describing the structure by what it promises, not how it's built. We separate the interface (the ...

A plain, precise definition of binary trees — and the one idea everything else follows from. We define the structure exactly, picture ...

The cost of every binary tree operation in one place — big-O, and the traps that bite in practice. We build the complexity table from ...

The invariants of binary trees: the facts that must stay true after every operation. We state each invariant plainly and show how the ...

When to reach for binary trees — and when not to. The design tradeoffs, side by side. We compare binary trees against the ...

The bugs people actually hit with binary trees — shown, explained, and fixed. A gallery of real mistakes: what they look like, why ...

The Binary Search Trees abstract data type: describing the structure by what it promises, not how it's built. We separate the ...

How binary trees actually live in memory — the byte-level layout behind the abstraction. We map the abstract picture onto real ...

In this video, we solve a coding problem on finding the longest consecutive path in a binary tree using preorder traversal and ...

A plain, precise definition of binary search trees — and the one idea everything else follows from. We define the structure exactly, ...

Explains how a binary search tree works through search, insert, and delete operations, and demonstrates the O(n) degeneration ...

Searching on binary search trees — finding an element, by scan or by binary search. This lesson shows exactly what happens, ...

The bugs people actually hit with binary search trees — shown, explained, and fixed. A gallery of real mistakes: what they look like ...

A tight recap of binary search trees: the mental model, the operations, and the costs — everything worth keeping. The essential ...

How binary search trees actually live in memory — the byte-level layout behind the abstraction. We map the abstract picture onto ...

A plain, precise definition of balanced trees — and the one idea everything else follows from. We define the structure exactly, ...

Insertion on binary search trees — adding an element, and the shifting it forces. This lesson shows exactly what happens, step by ...

We state each invariant plainly and show how the operations preserve it — the key to correct code. What you'll learn: • What an ...

When to reach for binary search trees — and when not to. The design tradeoffs, side by side. We compare binary search trees ...