
CS Roadmap (4) — Trees: Order, Balance, and Guaranteeing O(log n)
Introduction This article is the 4th installment of the CS Roadmap series. In Part 3, we saw that hash tables’ O(1) doesn’t come for free. Hash function quality, collision resolution strategi...

