ConceptTheory & Algos
Binary search tree
A binary tree where every node has at most two children and satisfies the search invariant that the right subtree contains greater keys and the left subtree contains smaller keys.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Binary tree5Binary search3Tree data structure2Array1Divide and conquer1Heap1Key-value data structures1Pointer1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Erik Demaine
A data structure associated with binary search that implements sets or dictionaries.Victor Costan
A binary tree where all nodes to the left are smaller and all nodes to the right are greater than the current node.David J. Malan
A tree data structure where each node has at most two children, organizing data hierarchically to allow efficient searching.Srini Devadas
A tree data structure where for any node, all keys in its left subtree are smaller than its key, and all keys in its right subtree are larger.
Lectures that assume it
18The first 12 are shown.
Connections
33The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures24
- Binary Search Trees & Runway Reservation Scheduling
- AVL Trees, Tree Rotations & Guaranteed O(log n) Height
- Data Structures
- Dynamic Programming: Advanced DP
- AVL Trees (MIT 6.006 Introduction to Algorithms, Recitation 6)
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
Show 18 moreShow fewer
- Geometric Structures I
- Integer Models
- Dynamic Graphs I
- Dynamic Connectivity Lower Bound
- History of Memory Models
- Cache-Oblivious Algorithms: Searching & Sorting
- Divide & Conquer: Van Emde Boas Trees
- Geometric Structures II
- Dynamic Optimality II
- Augmentation: Range Trees
- Strings
- Dynamic Graphs II
- Extremal Combinatorics Meets Algorithms and Data Structures
- R2. 2-3 Trees and B-Trees
- Memory Hierarchy Models
- B+Tree Indexes
- Cache-Oblivious Structures II
- Dynamic Optimality I