data structures - Number of binary tree with n node and n-3 height -


how many binary trees can find have n node , height of these tress n-3?

the total number of binary tree possible n nodes = (2ncn) / (n+1).

the minimum depth of binary tree ⌊log2n⌋ , maximum depth n-1.

so in each level level there [(2ncn) / (n+1)] / [(n-1) - (⌊log2n⌋)] nodes.


Comments

Popular posts from this blog

c# - Farseer ContactListener is not working -

Automatically create pages in phpfox -

database - one php page with different contents and urls -