What is the output of the following code in python, if the input is given as 8?
def CatalanNumber(n):
if n<= 1 :
return 1
result=0
for x in range(n):
result = result + CatalanNumber(x) * CatalanNumber(n-x-1)
return result
n=int(input("Enter the number:"))
answer=CatalanNumber(n)
print(" ", answer)
def CatalanNumber(n):
if n<= 1 :
return 1
result=0
for x in range(n):
result = result + CatalanNumber(x) * CatalanNumber(n-x-1)
return result
n=int(input("Enter the number:"))
answer=CatalanNumber(n)
print(" ", answer)A. 1432
B. 1430
C. 1438
D. 1462
Answer: Option B
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion