- prof doesn’t care bout base case, he’s more interested in the recursive case
- He also doesn’t care about going down the rabbit hole of recursion. Just show the single step that the function takes when called once:
- e.g: getting height of a binary tree: max(left, right) + 1