Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Millis(t)e funktsiooni(de) rekursioonipuuks sobib allpool toodud tasakaalus puu?
// <![CDATA[
document.write(pre('def f(n):\n if n == 0:\n return 1\n else:\n return f(n-1) + f(n-1)'));
// ]]>
def f(n): if n == 0: return 1 else: return f(n-1) + f(n-1)
def f(n):
if n == 0:
return 1
else:
return f(n-1) + f(n-1)
document.write(pre('def f(n):\n if n == 0:\n return 1\n elif n == 1:\n return f(n-1)\n else:\n return f(n-1) + f(n-1)'));
def f(n): if n == 0: return 1 elif n == 1: return f(n-1) else: return f(n-1) + f(n-1)
elif n == 1:
return f(n-1)
document.write(pre('def f(n):\n if n == 0:\n print(n)\n elif n == 1:\n print(n)\n return f(n-1)\n else:\n f(n-1)\n print(n)\n f(n-1)'));
def f(n): if n == 0: print(n) elif n == 1: print(n) return f(n-1) else: f(n-1) print(n) f(n-1)
print(n)
f(n-1)
document.write(pre('def f(n):\n if n == 0:\n return 1\n elif n == 1:\n return f(n-1)\n else:\n for i in range(n):\n f(n-i)'));
def f(n): if n == 0: return 1 elif n == 1: return f(n-1) else: for i in range(n): f(n-i)
for i in range(n):
f(n-i)
document.write(pre('def f(n):\n if n == 0:\n return 1\n elif n == 1:\n return f(n-1)\n else:\n return f(n-1) + f(n-2)'));
def f(n): if n == 0: return 1 elif n == 1: return f(n-1) else: return f(n-1) + f(n-2)
return f(n-1) + f(n-2)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!