ConceptSystems & CS
Recursion tree
A tree representing the costs of subproblems at each level of a recursive algorithm to solve recurrences.
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
5Each in their own terms, from the easiest level.
Julian Shun
A visual representation of the recursive calls made by an algorithm to analyze its total work or resource usage.Erik Demaine & Srini Devadas
A visual tree structure used to analyze the work and recurrence relations of divide-and-conquer algorithms.Charles Leiserson & Julian Shun
A tree representing the costs of the recursive subproblems in a divide-and-conquer relation, used to solve recurrences by summing costs across rows.Victor Costan
A recursion tree is a call graph used to visualize and solve recurrences by representing the cost of subproblems at each level.
Lectures that assume it
2Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Asymptotic notation
- Recurrence
- Big O notation
- Divide and conquer
- Divide and conquer recurrence
- Amnesic dynamic programming