Data Structures & AlgorithmsRecursion

What Is Recursion? Conceptual Foundation

LevelBeginner

Duration60 mins

TopicRecursion

2 / 4

Self-Referential Problem Solving

Solving Problems With Themselves

Imagine you're asked to count all the people in a large auditorium. You could count every person yourself—an exhausting, error-prone process. Or, you could ask the person next to you: "How many people are in the rest of the auditorium?" When they give you a number, you simply add 1 (yourself) to get the total. But how do they know the answer? They asked the person next to them the same question. And so on, until someone at the edge says, "There's nobody else past me"—the base case. The count then flows back: 0, then 1, then 2, building up to the final answer. This is self-referential problem solving —the essence of recursive thinking. Instead of solving the entire problem directly, you define the solution in terms of a slightly smaller version of itself. This page explores this powerful paradigm in depth.

What You Will Learn

By the end of this page, you will understand: how to decompose problems into smaller, self-similar subproblems; the art of trusting that recursive calls will produce correct results; how to identify the recursive structure hidden within complex problems; and the systematic process for formulating recursive solutions.

The Core Insight: Big Problems Contain Smaller Copies of Themselves

Self-referential problem solving rests on a profound observation: many problems are self-similar —they contain smaller instances of themselves. Consider these examples: A list is either empty, or it's an element followed by a (smaller) list. A tree is either a leaf, or it's a node with subtrees—each subtree is itself a complete tree. The task of searching a sorted array can be reduced to searching a smaller sorted array (binary search). The problem of sorting n elements can be reduced to sorting two halves of n/2 elements each (merge sort). In each case, the structure of the problem mirrors itself at different scales. When we solve such problems recursively, our solution reflects this self-similar structure, often resulting in remarkably concise and elegant code.

The Self-Similarity Question

When approaching a new problem, ask: "If I had a magic function that could solve smaller versions of this problem, how would I use it to solve the current problem?" This question is the key to unlocking recursive thinking. If you can answer it, you've found the recursive structure.

The structure of self-referential solutions: Every self-referential solution follows a pattern: Check if the problem is trivial (base case). If so, solve it directly. Break the problem into one or more smaller instances of the same problem. Solve the smaller instances (via recursive calls). Combine the solutions to the smaller instances to get the answer to the original problem. This pattern works because: The smaller instances will eventually become trivial (hitting base cases) We trust that the recursive calls correctly solve smaller instances The combination step correctly assembles the final answer

The 'Leap of Faith' — Trusting Recursive Calls

Perhaps the biggest mental hurdle in recursion is learning to trust that the recursive call will work. We call this the "leap of faith" —the willingness to assume that if we invoke our function on a smaller problem, it will return the correct answer. Why beginners struggle: When you write a recursive function, you're defining the function in terms of itself before the function is fully defined . This feels circular. Beginners often try to mentally trace every recursive call, which becomes overwhelming for even moderately complex inputs. The expert mindset: Experienced programmers don't trace every call. Instead, they reason as follows: Assume the recursive call works correctly for smaller inputs Focus only on whether the current level is correct given that assumption Verify separately that base cases are correct and that progress is guaranteed If these three things are true, the whole function must be correct, by induction.

Example: Leap of Faith in Action
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
def sum_list(lst):
    """
    Sums all elements in a list recursively.
    
    We DON'T trace every call. Instead, we reason:
    1. If the list is empty, the sum is 0 (base case - correct)
    2. Otherwise, the sum is first element + sum of the rest
    
    Leap of faith: We TRUST that sum_list(lst[1:]) correctly
    computes the sum of the remaining elements.
    
    Given that trust, we just need to add the first element.
    """
    # Base case: empty list has sum 0
    if len(lst) == 0:
        return 0
    
    # Recursive case: first element + sum of the rest
    # Leap of faith: sum_list(lst[1:]) returns correct answer
    return lst[0] + sum_list(lst[1:])
 
 
# We reason about this function like so:
# 
# For sum_list([3, 1, 4, 1, 5]):
# 
# DON'T think: "First it calls sum_list([1,4,1,5]) which calls
#              sum_list([4,1,5]) which calls sum_list([1,5])..."
# 
# DO think: "If sum_list([1,4,1,5]) correctly returns 11,
#           then 3 + 11 = 14, which is correct."
# 
# Trust + correct base case + progress = correctness

Why the Leap of Faith Works

The leap of faith isn't blind trust—it's mathematical induction in disguise. If the base case is correct, and if assuming correctness for smaller inputs implies correctness for larger inputs, then the function is correct for all valid inputs. You don't need to trace every call because you've proven correctness structurally.

Strategies for Decomposing Problems

The art of recursive thinking lies in finding the right way to break a problem into smaller subproblems. Different problem structures call for different decomposition strategies. Strategy 1: Peel Off One Element Process one element and recurse on the rest. This is the most common pattern for linear structures.

Peel Off One Element
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
def find_max(lst):
    """
    Find maximum element by comparing first element 
    against the max of the rest.
    
    Decomposition: problem[n] → element + problem[n-1]
    """
    # Base case: single element is its own max
    if len(lst) == 1:
        return lst[0]
    
    # Recursive case: compare first with max of rest
    max_of_rest = find_max(lst[1:])  # Leap of faith!
    return lst[0] if lst[0] > max_of_rest else max_of_rest
 
 
def reverse_string(s):
    """
    Reverse a string by moving first character to end of 
    reversed rest.
    
    Decomposition: reverse("hello") = reverse("ello") + "h"
    """
    # Base case: empty or single char is its own reverse
    if len(s) <= 1:
        return s
    
    # Recursive case: reverse the rest, then append first char
    return reverse_string(s[1:]) + s[0]

Strategy 2: Divide in Half (Divide and Conquer) Split the problem roughly in half, solve each half recursively, then combine. This often yields efficient O(n log n) algorithms.

Divide and Conquer
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
def binary_search(arr, target, low, high):
    """
    Search for target in a sorted array by repeatedly halving
    the search range.
    
    Decomposition: search[n] → search[n/2]
    """
    # Base case: empty range means not found
    if low > high:
        return -1
    
    mid = (low + high) // 2
    
    # Found it!
    if arr[mid] == target:
        return mid
    
    # Recursive case: search appropriate half
    if target < arr[mid]:
        return binary_search(arr, target, low, mid - 1)
    else:
        return binary_search(arr, target, mid + 1, high)
 
 
def sum_array_divide(arr, start, end):
    """
    Sum an array by dividing in half and summing each half.
    
    This demonstrates the pattern even though O(n) is the same.
    The real benefit shows in algorithms like merge sort.
    """
    # Base case: single element
    if start == end:
        return arr[start]
    
    # Divide and conquer
    mid = (start + end) // 2
    left_sum = sum_array_divide(arr, start, mid)
    right_sum = sum_array_divide(arr, mid + 1, end)
    
    return left_sum + right_sum

Strategy 3: Decompose by Structure For tree-like and nested structures, recurse into each branch or substructure.

Structural Decomposition
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class TreeNode:
    def __init__(self, val, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right
 
 
def tree_sum(node):
    """
    Sum all values in a binary tree by recursing into
    each subtree.
    
    Decomposition: tree problem → left subtree + right subtree
    """
    # Base case: empty tree has sum 0
    if node is None:
        return 0
    
    # Recursive case: sum = this node + left sum + right sum
    left_sum = tree_sum(node.left)    # Recurse left
    right_sum = tree_sum(node.right)  # Recurse right
    
    return node.val + left_sum + right_sum
 
 
def tree_height(node):
    """
    Find height of a binary tree.
    Height = 1 + max(height of left, height of right)
    """
    # Base case: empty tree has height -1 (or 0, depending on definition)
    if node is None:
        return -1
    
    # Recursive case: 1 + max of subtree heights
    left_height = tree_height(node.left)
    right_height = tree_height(node.right)
    
    return 1 + max(left_height, right_height)

Summary of Decomposition Strategies
Strategy	How It Works	Best For	Typical Reduction
Peel One Off	Process one item, recurse on rest	Linear structures (arrays, strings)	n → n-1
Divide in Half	Split in half, recurse on each half	Search, sorting, divide-and-conquer	n → n/2 (×2)
Structural	Recurse into each substructure	Trees, nested data, graphs	Depends on structure
Multiple Choices	Try each option, recurse from each	Backtracking, combinatorics	Branches out

Recognizing Recursive Structure in Problems

Not every problem has obvious recursive structure, but many do—if you know how to look. Here are key indicators that a problem might have a recursive solution:

Signs of Recursive Structure

•The problem involves a hierarchical or nested structure. Trees, directories, nested arrays, XML/JSON documents, organizational charts—anything with parent-child relationships often has natural recursive structure.
•The problem can be expressed as 'do something with part, then handle the rest.' If you can process the first element (or any element) and reduce the problem to a smaller version, recursion is likely applicable.
•The problem involves combinations, permutations, or subsets. Generating all possibilities often follows a pattern of 'include this element or don't, then handle remaining elements.'
•The problem naturally expresses as a mathematical recurrence. If you can write f(n) in terms of f(n-1), f(n-2), or f(n/2), the problem is recursive by definition.
•The data structure is recursive. Linked lists, trees, and graphs are defined recursively. Operations on them often naturally express recursively.
•The problem involves backtracking or exploring multiple paths. Mazes, game trees, constraint satisfaction—wherever you explore a path, may need to backtrack, and try another.

Example: Finding Recursive Structure in a Non-Obvious Problem Problem: Given climbing stairs where you can take 1 or 2 steps at a time, how many distinct ways can you climb n stairs? At first, this seems like a counting problem. But consider: to reach stair n, you must have come from stair n-1 (taking 1 step) or stair n-2 (taking 2 steps). The total ways to reach stair n is the sum of ways to reach n-1 and n-2. This is the Fibonacci recurrence! The problem has hidden recursive structure: Base cases: 1 way to climb 0 stairs (do nothing), 1 way to climb 1 stair Recursive case: ways(n) = ways(n-1) + ways(n-2)

Climbing Stairs - Discovering Recursive Structure
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
def climb_stairs(n):
    """
    Count distinct ways to climb n stairs, taking 1 or 2 steps at a time.
    
    Recursive insight:
    - To reach stair n, you came from stair n-1 or stair n-2
    - Total ways = ways to reach (n-1) + ways to reach (n-2)
    
    This IS the Fibonacci sequence!
    """
    # Base cases
    if n <= 1:
        return 1  # 1 way to climb 0 stairs, 1 way to climb 1 stair
    
    # Recursive case: sum of the two previous
    return climb_stairs(n - 1) + climb_stairs(n - 2)
 
 
# Trace for n = 4:
# climb_stairs(4) = climb_stairs(3) + climb_stairs(2)
#                 = (climb_stairs(2) + climb_stairs(1)) + (climb_stairs(1) + climb_stairs(0))
#                 = ((climb_stairs(1) + climb_stairs(0)) + 1) + (1 + 1)
#                 = ((1 + 1) + 1) + 2
#                 = (2 + 1) + 2
#                 = 3 + 2
#                 = 5
#
# 5 ways: [1,1,1,1], [1,1,2], [1,2,1], [2,1,1], [2,2]

The Problem Reduction Framework

Self-referential problem solving can be understood as problem reduction —transforming a complex problem into simpler problems until we reach problems simple enough to solve directly. The Problem Reduction Process:

•Define the problem precisely. What are the inputs? What exactly must the solution compute/produce? What are the constraints?
•Identify base cases. What are the smallest/simplest instances of this problem? What should the answer be for these cases?
•Ask: How can I reduce this to smaller instances? If I remove one element, split in half, or move one level up/down in a hierarchy—do I get a smaller version of the same problem?
•Define the recursive relationship. How exactly does the answer to the original problem relate to the answer(s) of the smaller problem(s)?
•Verify progress. Does every recursive call operate on a strictly smaller input? Will we definitely reach a base case?

Worked Example: Power Function Problem: Compute x^n (x raised to the power n) for non-negative integer n. Step 1: Define precisely Input: number x, non-negative integer n Output: x multiplied by itself n times Constraints: n \geq 0 Step 2: Base cases x^0 = 1 (anything to the power 0 is 1) Step 3: Reduction x^n = x \times x^(n-1) — peel off one multiplication Better: x^n = (x^(n/2))^2 — halve the exponent (square once) Step 4: Recursive relationship Simple: power(x, n) = x * power(x, n-1) Efficient: power(x, n) = power(x, n/2)^2 if n even; x * power(x, n-1) if n odd Step 5: Verify progress Simple: n decreases by 1 each call \to reaches 0 Efficient: n roughly halves each call \to reaches 0 quickly

Power Function - Two Approaches
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
def power_simple(x, n):
    """
    Compute x^n using simple reduction: x^n = x * x^(n-1)
    
    Time complexity: O(n) - linear in the exponent
    """
    # Base case
    if n == 0:
        return 1
    
    # Reduce by one
    return x * power_simple(x, n - 1)
 
 
def power_efficient(x, n):
    """
    Compute x^n using squared halving: x^n = (x^(n/2))^2
    
    Time complexity: O(log n) - much faster for large n!
    
    Insight: x^8 = (x^4)^2 = ((x^2)^2)^2 — only 3 multiplications!
    """
    # Base case
    if n == 0:
        return 1
    
    # If n is even: x^n = (x^(n/2))^2
    if n % 2 == 0:
        half = power_efficient(x, n // 2)
        return half * half
    
    # If n is odd: x^n = x * x^(n-1)
    else:
        return x * power_efficient(x, n - 1)
 
 
# Comparison for x=2, n=10:
# Simple: 10 recursive calls
# Efficient: 2^10 = (2^5)^2 = (2*(2^4))^2 = (2*((2^2)^2))^2
#            Only 4-5 recursive calls!
 
print(power_simple(2, 10))    # 1024
print(power_efficient(2, 10)) # 1024

Different Reductions = Different Efficiency

The same problem can often be reduced in multiple ways. The choice of reduction profoundly affects efficiency. Reducing by 1 gives O(n); reducing by half gives O(log n). Always consider: is there a way to shrink the problem faster?

Combining Sub-Solutions

After recursive calls return their results, we must combine those results to form the answer to the original problem. This combination step is where much of the problem-specific logic lives. Common combination patterns:

How Sub-Solutions Combine
Problem Type	Combination Operation	Example
Summation	Add sub-results together	sum(list) = head + sum(tail)
Counting	Add counts from subproblems	countNodes = 1 + countLeft + countRight
Finding maximum	Take max of sub-results	max(list) = max(head, max(tail))
Finding minimum	Take min of sub-results	min(list) = min(head, min(tail))
Building lists	Concatenate or cons elements	reverse(s) = reverse(tail) + head
Boolean queries	AND/OR sub-results	contains(x) = (head == x) OR contains(tail, x)
Merge results	Combine sorted sublists	mergeSort: merge(sorted left, sorted right)

The combination step answers: "Given the answers to my subproblems, how do I construct my answer?" This is often the creative part of recursive problem solving. The decomposition may be obvious, but figuring out how to reassemble the pieces requires understanding what the answer should look like. Example: Finding if a value exists in a binary search tree

Combination Example: BST Search
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
def bst_contains(node, target):
    """
    Check if target exists in a binary search tree.
    
    Decomposition: search left or right subtree
    Combination: found in either subtree means found overall
    
    Note: We don't search BOTH subtrees — BST property tells us which way to go!
    """
    # Base case: empty tree doesn't contain anything
    if node is None:
        return False
    
    # Found it at this node!
    if node.val == target:
        return True
    
    # Recursive case: search the appropriate subtree
    # The "combination" here is implicit — we return the recursive result directly
    if target < node.val:
        return bst_contains(node.left, target)
    else:
        return bst_contains(node.right, target)
 
 
def bst_sum_all(node):
    """
    Sum all values in a BST.
    
    Decomposition: sum left subtree + sum right subtree
    Combination: add this node's value to the sum of both subtrees
    """
    # Base case
    if node is None:
        return 0
    
    # Recursive calls
    left_sum = bst_sum_all(node.left)
    right_sum = bst_sum_all(node.right)
    
    # Combination: my value + children's sums
    return node.val + left_sum + right_sum

Practice: Identifying Self-Similar Structure

To develop self-referential thinking, practice identifying the recursive structure in these problems. For each, ask: What are the base cases? How can I reduce this to smaller instances of the same problem? How do I combine the sub-solutions?

Problems to Analyze

•String/Array Palindrome Check: Is this string the same forwards and backwards? Hint: First and last characters must match, AND the middle must be a palindrome.
•Count occurrences of x in a list: How many times does x appear? Hint: Count in first element + count in rest.
•Flatten a nested list: [[1, [2, 3]], [4]] → [1, 2, 3, 4] Hint: If element is a list, recursively flatten it. Otherwise, keep it.
•Generate all subsets of a set: {1, 2} → {}, {1}, {2}, {1, 2} Hint: For each element, either include it or don't. Recurse on remaining.
•Print all permutations of a string: "AB" → "AB", "BA" Hint: Pick each character as first, then permute the rest.
•Compute the GCD of two numbers: gcd(48, 18) = 6 Hint: Euclid's algorithm: gcd(a, b) = gcd(b, a mod b), base case when b = 0.

The Path to Fluency

Self-referential thinking becomes second nature with practice. Initially, you consciously apply the framework: base case, reduction, combination. Eventually, you'll immediately see the recursive structure in new problems. This is the goal of mastering recursion.

2 / 4

Perhaps the biggest mental hurdle in recursion is learning to trust that the recursive call will work. We call this the "leap of faith"—the willingness to assume that if we invoke our function on a smaller problem, it will return the correct answer.

Why beginners struggle:

When you write a recursive function, you're defining the function in terms of itself before the function is fully defined. This feels circular. Beginners often try to mentally trace every recursive call, which becomes overwhelming for even moderately complex inputs.

The expert mindset:

Experienced programmers don't trace every call. Instead, they reason as follows:

Assume the recursive call works correctly for smaller inputs
Focus only on whether the current level is correct given that assumption
Verify separately that base cases are correct and that progress is guaranteed

If these three things are true, the whole function must be correct, by induction.

def sum_list(lst): """ Sums all elements in a list recursively. We DON'T trace every call. Instead, we reason: 1. If the list is empty, the sum is 0 (base case - correct) 2. Otherwise, the sum is first element + sum of the rest Leap of faith: We TRUST that sum_list(lst[1:]) correctly computes the sum of the remaining elements. Given that trust, we just need to add the first element. """ # Base case: empty list has sum 0 if len(lst) == 0: return 0 # Recursive case: first element + sum of the rest # Leap of faith: sum_list(lst[1:]) returns correct answer return lst[0] + sum_list(lst[1:]) # We reason about this function like so: # # For sum_list([3, 1, 4, 1, 5]): # # DON'T think: "First it calls sum_list([1,4,1,5]) which calls # sum_list([4,1,5]) which calls sum_list([1,5])..." # # DO think: "If sum_list([1,4,1,5]) correctly returns 11, # then 3 + 11 = 14, which is correct." # # Trust + correct base case + progress = correctness

def find_max(lst): """ Find maximum element by comparing first element against the max of the rest. Decomposition: problem[n] → element + problem[n-1] """ # Base case: single element is its own max if len(lst) == 1: return lst[0] # Recursive case: compare first with max of rest max_of_rest = find_max(lst[1:]) # Leap of faith! return lst[0] if lst[0] > max_of_rest else max_of_rest def reverse_string(s): """ Reverse a string by moving first character to end of reversed rest. Decomposition: reverse("hello") = reverse("ello") + "h" """ # Base case: empty or single char is its own reverse if len(s) <= 1: return s # Recursive case: reverse the rest, then append first char return reverse_string(s[1:]) + s[0]

def binary_search(arr, target, low, high): """ Search for target in a sorted array by repeatedly halving the search range. Decomposition: search[n] → search[n/2] """ # Base case: empty range means not found if low > high: return -1 mid = (low + high) // 2 # Found it! if arr[mid] == target: return mid # Recursive case: search appropriate half if target < arr[mid]: return binary_search(arr, target, low, mid - 1) else: return binary_search(arr, target, mid + 1, high) def sum_array_divide(arr, start, end): """ Sum an array by dividing in half and summing each half. This demonstrates the pattern even though O(n) is the same. The real benefit shows in algorithms like merge sort. """ # Base case: single element if start == end: return arr[start] # Divide and conquer mid = (start + end) // 2 left_sum = sum_array_divide(arr, start, mid) right_sum = sum_array_divide(arr, mid + 1, end) return left_sum + right_sum

class TreeNode: def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right def tree_sum(node): """ Sum all values in a binary tree by recursing into each subtree. Decomposition: tree problem → left subtree + right subtree """ # Base case: empty tree has sum 0 if node is None: return 0 # Recursive case: sum = this node + left sum + right sum left_sum = tree_sum(node.left) # Recurse left right_sum = tree_sum(node.right) # Recurse right return node.val + left_sum + right_sum def tree_height(node): """ Find height of a binary tree. Height = 1 + max(height of left, height of right) """ # Base case: empty tree has height -1 (or 0, depending on definition) if node is None: return -1 # Recursive case: 1 + max of subtree heights left_height = tree_height(node.left) right_height = tree_height(node.right) return 1 + max(left_height, right_height)

Summary of Decomposition Strategies

Strategy

How It Works

Best For

Typical Reduction

Peel One Off

Process one item, recurse on rest

Linear structures (arrays, strings)

n → n-1

Divide in Half

Split in half, recurse on each half

Search, sorting, divide-and-conquer

n → n/2 (×2)

Structural

Recurse into each substructure

Trees, nested data, graphs

Depends on structure

Multiple Choices

Try each option, recurse from each

Backtracking, combinatorics

Branches out

def climb_stairs(n): """ Count distinct ways to climb n stairs, taking 1 or 2 steps at a time. Recursive insight: - To reach stair n, you came from stair n-1 or stair n-2 - Total ways = ways to reach (n-1) + ways to reach (n-2) This IS the Fibonacci sequence! """ # Base cases if n <= 1: return 1 # 1 way to climb 0 stairs, 1 way to climb 1 stair # Recursive case: sum of the two previous return climb_stairs(n - 1) + climb_stairs(n - 2) # Trace for n = 4: # climb_stairs(4) = climb_stairs(3) + climb_stairs(2) # = (climb_stairs(2) + climb_stairs(1)) + (climb_stairs(1) + climb_stairs(0)) # = ((climb_stairs(1) + climb_stairs(0)) + 1) + (1 + 1) # = ((1 + 1) + 1) + 2 # = (2 + 1) + 2 # = 3 + 2 # = 5 # # 5 ways: [1,1,1,1], [1,1,2], [1,2,1], [2,1,1], [2,2]

def power_simple(x, n): """ Compute x^n using simple reduction: x^n = x * x^(n-1) Time complexity: O(n) - linear in the exponent """ # Base case if n == 0: return 1 # Reduce by one return x * power_simple(x, n - 1) def power_efficient(x, n): """ Compute x^n using squared halving: x^n = (x^(n/2))^2 Time complexity: O(log n) - much faster for large n! Insight: x^8 = (x^4)^2 = ((x^2)^2)^2 — only 3 multiplications! """ # Base case if n == 0: return 1 # If n is even: x^n = (x^(n/2))^2 if n % 2 == 0: half = power_efficient(x, n // 2) return half * half # If n is odd: x^n = x * x^(n-1) else: return x * power_efficient(x, n - 1) # Comparison for x=2, n=10: # Simple: 10 recursive calls # Efficient: 2^10 = (2^5)^2 = (2*(2^4))^2 = (2*((2^2)^2))^2 # Only 4-5 recursive calls! print(power_simple(2, 10)) # 1024 print(power_efficient(2, 10)) # 1024

How Sub-Solutions Combine

Problem Type

Combination Operation

Example

Summation

Add sub-results together

sum(list) = head + sum(tail)

Counting

Add counts from subproblems

countNodes = 1 + countLeft + countRight

Finding maximum

Take max of sub-results

max(list) = max(head, max(tail))

Finding minimum

Take min of sub-results

min(list) = min(head, min(tail))

Building lists

Concatenate or cons elements

reverse(s) = reverse(tail) + head

Boolean queries

AND/OR sub-results

contains(x) = (head == x) OR contains(tail, x)

Merge results

Combine sorted sublists

mergeSort: merge(sorted left, sorted right)

def bst_contains(node, target): """ Check if target exists in a binary search tree. Decomposition: search left or right subtree Combination: found in either subtree means found overall Note: We don't search BOTH subtrees — BST property tells us which way to go! """ # Base case: empty tree doesn't contain anything if node is None: return False # Found it at this node! if node.val == target: return True # Recursive case: search the appropriate subtree # The "combination" here is implicit — we return the recursive result directly if target < node.val: return bst_contains(node.left, target) else: return bst_contains(node.right, target) def bst_sum_all(node): """ Sum all values in a BST. Decomposition: sum left subtree + sum right subtree Combination: add this node's value to the sum of both subtrees """ # Base case if node is None: return 0 # Recursive calls left_sum = bst_sum_all(node.left) right_sum = bst_sum_all(node.right) # Combination: my value + children's sums return node.val + left_sum + right_sum

Self-Referential Problem Solving

Solving Problems With Themselves

The Core Insight: Big Problems Contain Smaller Copies of Themselves

The 'Leap of Faith' — Trusting Recursive Calls

Strategies for Decomposing Problems

Recognizing Recursive Structure in Problems

The Problem Reduction Framework

Combining Sub-Solutions

Practice: Identifying Self-Similar Structure

There’s more to understand.

Self-Referential Problem Solving

Solving Problems With Themselves

The Core Insight: Big Problems Contain Smaller Copies of Themselves

The 'Leap of Faith' — Trusting Recursive Calls

Strategies for Decomposing Problems

Recognizing Recursive Structure in Problems

The Problem Reduction Framework

Combining Sub-Solutions

Practice: Identifying Self-Similar Structure

There’s more to understand.