Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, 2022 (MIT Press) - This foundational textbook provides comprehensive coverage of Binary Search Trees, their operations (search, insert, delete), and the theoretical underpinnings, including the analysis of their performance and the introduction to self-balancing variants.
Lecture 7: Binary Search Trees, AVL Trees, Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon, 2020 (MIT OpenCourseWare) - Official lecture notes from a renowned algorithms course, offering clear conceptual explanations, visualizations, and pseudocode for Binary Search Trees and their balanced counterparts.
Algorithms, Robert Sedgewick and Kevin Wayne, 2011 (Addison-Wesley Professional) - A highly regarded textbook known for its pedagogical approach and practical implementations, providing detailed coverage of BSTs and the importance of balanced tree structures.