Data Structures & Algorithms

Recursion

/rɪˈkɜːʃən/

Definition

A function call to itself with a smaller input, solving problems by breaking them into identical sub-problems.

Example in context

"Tree traversal naturally uses recursion — visit the node, recurse left, recurse right."

Practice this term

Master Recursion in context by working through exercises in the Data Structures & Algorithms module. You'll see the term used in real engineering scenarios with multiple-choice, fill-in-the-blank, and matching drills.