Data-Structures-and-Algorithms/Count Balanced Binary Trees of Height h at master · shoaibrayeen/Data-Structures-and-Algorithms · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp
code_2.cpp		code_2.cpp
code_3.cpp		code_3.cpp
readMe.md		readMe.md

readMe.md

Given a height h, count and return the maximum number of balanced binary trees possible with height h. A balanced binary tree is one in which for every node, the difference between heights of left and right subtree is not more than 1.

Input : h = 3
Output : 15

Input : h = 4
Output : 315