// TOPIC
#binary-search
3 articles
◆Beginner
01Searching: Linear vs Binary
Binary search vs linear search explained from first principles — why halving a sorted list gives you O(log n), when it crushes linear search, and why hash tables beat both.
#searching#binary-search#algorithms
10 min◆◆IntermediateAmazonGoogle
02Binary Search Trees
The left<node<right invariant gives you O(log n) search, insert, and delete — until the tree degenerates into a linked list. Here's the full picture, including why inorder traversal is a free sort.
#trees#data-structures#binary-search
11 min◆◆IntermediateGoogleAmazon
03Binary Search (Beyond the Sorted Array)
Master the binary search algorithm once and for all — the invariant that kills off-by-one bugs, and the "search on the answer" trick that works on problems that don't look like binary search at all.
#binary-search#searching#techniques
10 min