search

GDSC-IGDTUW-Autumn-of-Code-2022 / ip-questions-2023

INTERVIEW PRACTICE
0 stars 5 forks source link

No. of balanced BTs #27

Open AarnaSinghal opened 1 year ago

AarnaSinghal commented 1 year ago

Given an integer h, find the possible number of balanced binary trees of height h. You just need to return the count of possible binary trees which are balanced. This number can be huge, so, return output modulus 10^9 + 7. Write a simple recursive solution. Input Format : The first and only line of input contains an integer, that denotes the value of h. Here, h is the height of the tree. Output Format : The first and only line of output contains the count of balanced binary trees modulus 10^9 + 7. Constraints : 1 <= h <= 24 Time Limit: 1 sec Sample Input 1: 3 Sample Output 1: 15

AarnaSinghal commented 1 year ago

@gdsc-igdtuw @Parul-Mann @Khxshx please assign this issue to me