Ononot — If a recursive function f(n) calls itself with f(n-1) and f(

Recursionhard

0:00.0

If a recursive function $f(n)$ calls itself with $f(n-1)$ and $f(n-2)$ , which data structure prevents exponential time complexity by storing intermediate results?