A linear chain with $n$ nodes

A complete binary tree with depth $n$ and approximately $2^{n+1} - 1$ total nodes

At depth $d$, there are exactly $2^d$ function calls

Both B and C