CSE201, Winter 2025, Lec 7, Part 2: The optimal binary search tree problem

Name: CSE201, Winter 2025, Lec 7, Part 2: The optimal binary search tree problem
Uploaded: 2025-07-17T00:00:00.000Z
Duration: 13 min 7 s
Description: This lecture segment sets up the optimal binary search tree problem: when some keys are looked up far more often than others, a balanced BST's uniform O(m log n) is no longer the right target, and you should instead b...

C. Seshadhri · 13:07

This lecture segment sets up the optimal binary search tree problem: when some keys are looked up far more often than others, a balanced BST's uniform O(m log n) is no longer the right target, and you should instead b...

Read the full summary on tuber