Ch3

Question 1

Recursive functions need two cases

Answer 1

Base case
Recursive case

Question 2

Base case

Answer 2

When to stop recursing

Question 3

Recursive case

Answer 3

When to keep recursing

Question 4

Push

Answer 4

Add a new item to the end

Question 5

Pop

Answer 5

Remove an item from the end

Question 6

Stack

Answer 6

A simple data with push and pop.

Like a stack of books. Last in first out.

Question 7

What to do if a call stack is too big

Answer 7

1. Rewrite to use a loop
2. Tail recursion

Question 8

Tail recursion

Answer 8

A recursive function where the recursive call is the last one executed. This can be optimized by the compiler in some languages to use less space on the call stack.