Feel free to try these problems on the worksheet in discussion or on your own, and then come back to reference these walkthrough videos as you study.
To see these videos, you should be logged into your berkeley.edu email.
A tree recursive function is a recursive function that makes more than one call to itself, resulting in a tree-like series of calls.
For example, let's say we want to recursively calculate the
def virfib(n): if n == 0 or n == 1: return n return virfib(n - 1) + virfib(n - 2)
virfib(6) results in the following call structure that looks like
an upside-down tree (where
f(i) node represents a recursive call to
Each recursive call
f(i) makes another two recursive calls,
which are to
Whenever we reach a
f(1) node, we can directly return
rather than making more recursive calls, since these are our base cases.
In other words, base cases have the information needed to return an answer directly, without depending upon results from other recursive calls. Once we've reached a base case, we can then begin returning back from the recursive calls that led us to the base case in the first place.
Generally, tree recursion can be effective for problems where there are multiple possibilities or choices at a current state. In these types of problems, you make a recursive call for each choice or for a group of choices.
Q1: Count Stair Ways
Imagine that you want to go up a flight of stairs that has
n is a positive integer.
You can either take 1 or 2 steps each time.
In this question, you'll write a function
count_stair_ways that solves this problem.
Before you code your approach, consider these questions.
How many different ways can you go up this flight of stairs?
Solution: When there is only one step, there is only one way to go up the stair. When there are two steps, we can go up in two ways: take a single 2-step, or take two 1-steps.
What’s the base case for this question? What is the simplest input?
Our first base case is when there is one step left.
This is, by definition, the smallest input since it is the smallest positive integer.
Our second base case is when we have two steps left.
We need this base case for a similar reason that
fibonacci needs 2 base cases:
to cover both recursive calls.
Alternate solution: Our first base case is where there are no steps left. This means that we took an action in the previous recursive step that led to our goal of reaching the top. Our second base case is where we have overstepped. This means that the action we took is not valid, as it caused us to step over our goal.
count_stair_ways(n - 1) and
count_stair_ways(n - 2) represent?
count_stair_ways(n - 1) represents the number of different ways to go up the
n-1 stairs (this is the case where we take 1 step as our move).
count_stair_ways(n - 2) represents the number of different ways to go up the
n-2 stairs (this is the case where we take 2 steps as our move).
Fill in the code for
def count_stair_ways(n): """Returns the number of ways to climb up a flight of n stairs, moving either 1 step or 2 steps at a time. >>> count_stair_ways(4) 5 """ if n == 1: return 1 elif n == 2: return 2 return count_stair_ways(n-1) + count_stair_ways(n-2)
Here's a tree of the calls made to
Q2: Count K
Consider a special version of the
count_stair_ways problem, where instead of taking 1 or 2 steps, we are able to take up to and including
k steps at a time. Write a function
count_k that figures out the number of paths for this scenario. Assume
k are positive.
def count_k(n, k): """ Counts the number of paths up a flight of n stairs when taking up to and including k steps at a time. >>> count_k(3, 3) # 3, 2 + 1, 1 + 2, 1 + 1 + 1 4 >>> count_k(4, 4) 8 >>> count_k(10, 3) 274 >>> count_k(300, 1) # Only one step at a time 1 """ if n == 0: return 1 elif n < 0: return 0 else: total = 0 i = 1 while i <= k: total += count_k(n - i, k) i += 1 return total
Here's a tree of the calls made to
A list is a data structure that can store multiple elements. Each element can be any type, even a list itself. We write a list as a comma-separated list of expressions in square brackets:
>>> list_of_ints = [1, 2, 3, 4] >>> list_of_bools = [True, True, False, False] >>> nested_lists = [1, [2, 3], [4, ]]
Each element in the list has an index, with the index of the first element
0. We say that lists are therefore "zero-indexed."
With list indexing, we can specify the index of the element we want to retrive.
A negative index represents starting from the end of the list, where the
-i is equivalent to the positive index
>>> lst = [6, 5, 4, 3, 2, 1, 0] >>> lst 6 >>> lst 3 >>> lst[-1] # Same as lst 0
To create a copy of part or all of a list, we can use list slicing.
The syntax to slice a list
lst[<start index>:<end index>:<step size>].
This expression evaluates to a new list containing the elements of
- Starting at and including the element at
- Up to but not including the element at
<step size>as the difference between indices of elements to include.
If the start, end, or step size are not explicitly specified, Python has default values for them. A negative step size indicates that we are stepping backwards through a list when including elements.
>>> lst[:3] # Start index defaults to 0 [6, 5, 4] >>> lst[3:] # End index defaults to len(lst) [3, 2, 1, 0] >>> lst[::-1] # Make a reversed copy of the entire list [0, 1, 2, 3, 4, 5, 6] >>> lst[::2] # Skip every other; step size defaults to 1 otherwise [6, 4, 2, 0]
List comprehensions are a compact and powerful way of creating new lists out of sequences. The general syntax for a list comprehension is the following:
[<expression> for <element> in <sequence> if <conditional>]
if <conditional> section is optional.
The syntax is designed to read like English: "Compute the expression for each element in the sequence (if the conditional is true for that element)."
>>> [i**2 for i in [1, 2, 3, 4] if i % 2 == 0] [4, 16]
This list comprehension will:
- Compute the expression
- For each element
iin the sequence
[1, 2, 3, 4]
i % 2 == 0(
iis an even number),
and then put the resulting values of the expressions into a new list.
In other words, this list comprehension will create a new list that contains
the square of every even element of the original list
[1, 2, 3, 4].
We can also rewrite a list comprehension as an equivalent
such as for the example above:
>>> lst =  >>> for i in [1, 2, 3, 4]: ... if i % 2 == 0: ... lst = lst + [i**2] >>> lst [4, 16]
Q3: WWPD: Lists
What would Python display?
>>> a = [1, 5, 4, [2, 3], 3] >>> print(a, a[-1])
>>> 2 in a
Q4: Even weighted
Write a function that takes a list
s and returns a new list that keeps only
the even-indexed elements of
s and multiplies them by their corresponding
def even_weighted(s): """ >>> x = [1, 2, 3, 4, 5, 6] >>> even_weighted(x) [0, 6, 20] """ return [i * s[i] for i in range(len(s)) if i % 2 == 0]
The key point to note is that instead of iterating over each element in the list, we must instead iterate over the indices of the list. Otherwise, there's no way to tell if we should keep a given element.
One way of solving these problems is to try and write your solution as a
loop first, and then transform it into a list comprehension.
for loop solution might look something like this:
result =  for i in range(len(s)): if i % 2 == 0: result = result + [i * s[i]] return result
Q5: Max Product
Write a function that takes in a list and returns the maximum product that can be formed using nonconsecutive elements of the list. The input list will contain only numbers greater than or equal to 1.Your Answer Run in 61A Code
def max_product(s): """Return the maximum product that can be formed using non-consecutive elements of s. >>> max_product([10,3,1,9,2]) # 10 * 9 90 >>> max_product([5,10,5,10,5]) # 5 * 5 * 5 125 >>> max_product() 1 """ if s == : return 1 else: return max(max_product(s[1:]), s * max_product(s[2:]))
At each step, we choose if we want to include the current number in our product or not:
- If we include the current number, we cannot use the adjacent number.
- If we don't use the current number, we try the adjacent number (and obviously ignore the current number).
The recursive calls represent these two alternate realities. Finally, we pick the one that gives us the largest product.