# Binary Search Trees

Binary Search Trees: A Contact List That's Fast to Search and Easy to Change: Binary Search Trees, The Sorted Import That Made Search Crawl: Why Balance…

Updated: November 17, 2026

1. [A Contact List That's Fast to Search and Easy to Change: Binary Search Trees](https://www.ask-codey.com/lessons/ds-binary-search-trees) (Journeyman): Keep 100,000 contacts so a name is found on every keystroke, new contacts go in all day, and the screen shows everyone A to Z, or from Kai to Maya, without sorting: why an unsorted list, a sorted array and a dictionary each fall short, and the structure that fixes them, the binary search tree.
2. [The Sorted Import That Made Search Crawl: Why Balance Matters](https://www.ask-codey.com/lessons/ds-tree-balance) (Journeyman): Keep a contact list fast however its names arrive: see why a sorted import turns a plain binary search tree into a line as slow as a list, why shuffling and rebuilding don't fix it, and which always-balanced sorted map your language gives you.
3. [One Row in a Billion: B-Trees and Database Indexes](https://www.ask-codey.com/lessons/ds-b-trees) (Freelancer): Find one customer by email among a billion rows in a few disk reads, not minutes: why reading every row and a binary search tree are both too slow on disk, and the structure inside nearly every database index, the B-tree.

Source: https://www.ask-codey.com/courses/data-structures/topics/ds-binary-search-trees
