Register

Binary tree

• recategorized by
766 views
0 0 votes
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · PIPELININGNext → · compiler design Lexi...
← Previous in category · Made Easy Subject Te...Next in category → · #programming
Position:
Show:

Related questions

1 1 vote
1 1 answer
494
494 views
rahul sharma 5 asked Dec 19, 2016
494 views
MadeEasy Test Series: Programming & DS - Binary Tree
2 2 votes
3 3 answers
1.6k
1.6k views
Shamim Ahmed asked Dec 26, 2018
1,633 views
MadeEasy Test Series: Programming & DS - Binary Tree
1 1 vote
2 2 answers
2.1k
2.1k views
CHïntän ÞäTël asked Dec 10, 2018
2,051 views
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
0 0 votes
0 0 answers
745
745 views
sunaina rawat asked Nov 7, 2017
745 views
MadeEasy Subject Test: Programming & DS - Binary Tree
Consider programint foo(struct node *tree){if(tree==0)return 0;int lh=ht(tree->left);int rh=ht(tree->right);int ld=foo(tree->left);int rd=foo(tree->right);return max(lh+r...