May 1, 2024
Updated May 10, 2025
23 minute read
A Binary Search Tree (BST) is a fundamental data structure in computer science. At its core, a BST is a binary tree where each node has a comparable key (and an associated value) and satisfies the BST property: the key in any node is greater than or equal to any key stored in its left sub-tree and less than or equal to any key stored in its right sub-tree. This structure allows for efficient searching, insertion, and deletion of data. Think of it as an organized filing system where you can quickly locate a specific file by following a set of ordered rules.
nunys9|
Find a path to becoming a Binary Search Tree. Learn more at:
OpenCourser.com/topic/nunys9/binary
Reading list
We've selected 12 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 Tree.
A comprehensive treatment of BSTs from Donald Knuth, covering various aspects such as performance analysis, search and insert algorithms, and applications.
A comprehensive and accessible guide to the theory and practice of algorithms. Includes a section on BSTs and their use in various applications.
A comprehensive guide to data structures and algorithms in Java, including a thorough treatment of BSTs and their implementation in Java.
An overview and introduction to algorithms, including a section on Binary Search Trees (BSTs) and how BSTs compare against alternatives such as hash tables and ordered lists.
A widely-used textbook covering essential algorithms and data structures. Includes a chapter on BSTs, discussing their properties, operations, and applications.
A Python-based introduction to data structures and algorithms, including a section on BSTs and their implementation in Python.
A comprehensive introduction to the foundations of algorithms, including a section on BSTs and their role in various algorithms.
A Java-based introduction to data structures and algorithms. Includes a section on BSTs and their implementation in Java.
A comprehensive introduction to algorithms and programming techniques. Includes a section on BSTs and their uses in various applications.
An accessible introduction to algorithm design techniques and principles. Provides numerous examples with code pseudocode, including an in-depth discussion of BSTs.
A comprehensive guide to data structures and algorithms in C++, with a discussion on BSTs and their uses in various applications.
A concise and practical guide to essential algorithms. Includes a section on BSTs, their operations, and their use cases.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/nunys9/binary
Save
