May 1, 2024
Updated May 10, 2025
29 minute read
A Binary Search Tree (BST) is a fundamental data structure in computer science used for organizing and managing sorted data. At its core, a BST is a node-based binary tree where each node has a comparable key (and an associated value, if any), and it satisfies the binary search property: the key in any node is greater than or equal to any key stored in its left subtree and less than or equal to any key stored in its right subtree. This ordered structure allows for efficient searching, insertion, and deletion of data. For those new to data structures, think of it as an organized filing system where finding a specific file is much faster than rummaging through a disorganized pile.
ns8ell|
Find a path to becoming a Binary Search Trees. Learn more at:
OpenCourser.com/topic/ns8ell/binary
Reading list
We've selected nine books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Binary Search Trees.
This classic work by Donald Knuth provides an in-depth analysis of sorting and searching algorithms, including binary search trees. It covers a wide range of topics, from the basics of BSTs to advanced techniques such as splay trees and B-trees. The book valuable resource for anyone seeking a deep understanding of BSTs and their applications.
This textbook offers a comprehensive introduction to algorithms, including a chapter on binary search trees. It covers the theoretical foundations of BSTs, their performance analysis, and various applications. The book is known for its clear explanations and豊富な examples, making it a valuable resource for students and practitioners alike.
This classic textbook provides a comprehensive overview of algorithms, including a detailed chapter on binary search trees. It covers the fundamental concepts, properties, and applications of BSTs, making it a valuable resource for anyone seeking a thorough understanding of the topic.
By Robert Tarjan classic work on binary search trees. It provides a thorough theoretical treatment of the topic, covering topics such as the structure and properties of BSTs, their analysis, and various applications. The book is suitable for advanced students and researchers interested in the theoretical foundations of BSTs.
This textbook focuses on data structures and algorithms in Java, with a dedicated chapter on binary search trees. It provides a clear and concise explanation of BSTs, including their implementation, operations, and applications. The Java code examples make it easy to understand the practical aspects of BSTs.
This textbook focuses on data structures in Java, including a chapter on binary search trees. It covers the fundamental concepts and operations of BSTs, with a focus on their practical implementation in Java. The book is suitable for undergraduate students and practitioners interested in learning about BSTs in the context of Java programming.
This textbook focuses on data structures and algorithm analysis in C++, with a chapter on binary search trees. It provides a clear and concise explanation of BSTs, their implementation in C++, and their applications. The book is suitable for undergraduate students and practitioners interested in learning about BSTs in the context of C++ programming.
Provides a specialized treatment of binary search trees, focusing on their implementation and applications. It covers advanced topics such as self-balancing BSTs, skip lists, and finger search trees. The book is suitable for advanced students and researchers interested in the intricacies of BSTs.
This textbook introduces data structures and algorithms in JavaScript, with a chapter on binary search trees. It covers the fundamental concepts and operations of BSTs, with a focus on their practical implementation in JavaScript. The book is suitable for undergraduate students and practitioners interested in learning about BSTs in the context of JavaScript programming.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/ns8ell/binary
Save
