Recursion shows up in nearly every computer science course, and it trips up almost every student the first time. The idea that a function can call itself feels circular, even illegal — and then trees and linked lists arrive and the confusion compounds. If you have a CS exam coming up, a data structures assignment due, or you just need to finally understand what the call stack is actually doing, this guide is written for you.

**TLDR: Recursion and Recursive Data Structures** covers everything a high school or early college student needs to get comfortable with the topic. You'll start with how recursive functions work and how to read the call stack like a mental movie. From there, you'll work through factorial, merge sort, and binary search — concrete, numbered examples in pseudocode and Python-style syntax. Then the guide moves into the data structures that make recursion click: linked lists defined as a node plus a smaller list, and binary trees where recursive traversal stops feeling like magic and starts feeling obvious.

The final section is honest about tradeoffs — when recursion is the right tool, when iteration wins, and how stack limits and the Fibonacci pitfall motivate memoization. Each concept is introduced with a plain-English definition before any code appears.

This is a focused primer, not a textbook. No filler, no padding — just the core ideas, worked examples, and the conceptual clarity you need to walk into class or an ap computer science exam on recursion with confidence.

Grab it, read it once, and understand recursion.

• Understand what recursion is and how a function call stack executes recursive calls
• Identify base cases and recursive cases, and write recursive functions correctly
• Trace recursive execution by hand and reason about termination
• Define and manipulate recursive data structures like linked lists and binary trees
• Recognize when recursion is the right tool and when iteration or memoization is better

1. 1. What Recursion Actually Is
   Introduces recursion as solving a problem by reducing it to a smaller instance of the same problem, with the call stack as the mental model.
2. 2. Writing Your First Recursive Functions
   Walks through factorial, sum-of-list, and power functions, showing how to choose a base case and shrink the input each call.
3. 3. Recursive Thinking: Divide, Conquer, and Combine
   Covers the divide-and-conquer pattern with binary search and merge sort, plus the Fibonacci pitfall that motivates memoization.
4. 4. Recursive Data Structures: Linked Lists
   Defines linked lists as a recursive structure (a node plus a smaller list) and implements length, search, and reverse recursively.
5. 5. Trees and Recursive Traversal
   Introduces binary trees, binary search trees, and the three classic traversals, showing why trees are where recursion really pays off.
6. 6. When to Use Recursion (and When Not To)
   Compares recursion with iteration, discusses tail calls, stack limits, and gives heuristics for choosing the right approach.