Q: What is the maximum number of waiting multiplications?
A: 4 multiplications
Q: What is the maximum number of waiting multiplications (in terms of e)?
A: log2e+1 multiplications
Each waiting multiplication requires that Scheme allocate extra memory, so the amount of memory required by tree recursive power is Θ(log e).