How many binary trees can find that have n Node and the height of these tress are n-3?
The total number of Binary Tree possible with
n nodes = (2nCn) / (n+1).
The minimum depth of a binary tree is ⌊log2n⌋ and the maximum depth is
So in each level level there will be [(2nCn) / (n+1)] / [(n-1) - (⌊log2n⌋)] nodes.