Sign inSign in
ConceptSystems & CS

Recursion tree

A tree representing the costs of subproblems at each level of a recursive algorithm to solve recurrences.
as Srini Devadas 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Julian Shun

    MIT · Undergraduate

    A visual representation of the recursive calls made by an algorithm to analyze its total work or resource usage.
    • 1:05:21Caching and Cache-Efficient Algorithms
    • 1:03:53Cache-Oblivious Algorithms
  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    A visual tree structure used to analyze the work and recurrence relations of divide-and-conquer algorithms.
    • 40:03Divide & Conquer: FFT
  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

    A tree representing the costs of the recursive subproblems in a divide-and-conquer relation, used to solve recurrences by summing costs across rows.
    • 2:13Analysis of Multithreaded Algorithms
  • Victor Costan

    MIT · Undergraduate

    A recursion tree is a call graph used to visualize and solve recurrences by representing the cost of subproblems at each level.
    • 4:24Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)

Lectures that assume it

2

Connections

15

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

5 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.