Ordered trees that enable O(log n) search, insert, and delete.
Learn how binary search trees keep data sorted for fast lookup, insertion, and deletion — with interactive visualizations of every operation.