Binary search trees promise O(log n) search, insertion, and deletion. They deliver that promise only when balanced. Insert sorted data into a naive BST and you get a linked list with O(n) operations….
Read more →Red-black trees are the workhorses of balanced binary search trees. They power std::map in C++, TreeMap in Java, and countless database indexes. But if you’ve ever tried to implement one from…
In 1993, Swedish computer scientist Arne Andersson published a paper that should have changed how we teach self-balancing binary search trees. His AA tree (named after his initials) achieves the same…
Read more →