Sign inSign in
ConceptSystems & CS

Tree recursion

A process where a function makes more than one recursive call per step, resulting in a branching tree of computations.
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.

Recursion2Deferred operations1Procedure1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Eric Grimson

    MIT · Undergraduate

    A recursive procedure pattern where a procedure makes multiple recursive calls within its body, giving rise to tree-like execution structures.
    • 9:10Orders of Growth and Kinds of Procedures

Lectures that assume it

1

Connections

8

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

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