Sign inSign in

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.
as Victor Costan defines itMITThe wording closest to all 6 definitions
Watch it explained

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

4

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A data structure associated with binary search that implements sets or dictionaries.
    • 0:40Binary Search Trees & Runway Reservation Scheduling
    • 1:15AVL Trees, Tree Rotations & Guaranteed O(log n) Height
  • Victor Costan

    MIT · Undergraduate

    A binary tree where all nodes to the left are smaller and all nodes to the right are greater than the current node.
    • 28:08Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
  • David J. Malan

    Harvard University · Undergraduate

    A tree data structure where each node has at most two children, organizing data hierarchically to allow efficient searching.
  • Srini Devadas

    MIT · Undergraduate

    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.
    • 26:07Dynamic Programming: Advanced DP

Lectures that assume it

18

The first 12 are shown.

Connections

33

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.