reopened by
907 views
0 votes
0 votes

Consider a binary tree, where for every node $P-Q\leq 2$.Prepresent number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for $h>0$. The minimum number of node present in such binary tree of height $h=4$ _____________

 

Im getting 8. kindly verify

reopened by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Na462 asked Jan 16, 2019
373 views
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. T...
0 votes
0 votes
0 answers
2
Soumya29 asked Oct 22, 2018
302 views
I know the answer. But is there any general FORMULA for it?If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h-1}+1.$ I tri...
0 votes
0 votes
0 answers
3
Na462 asked Oct 20, 2018
591 views
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........
2 votes
2 votes
1 answer
4
Vaishnavi01 asked Sep 28, 2018
638 views
A. Total no. of trees that were there in the forest.B. Total no. of nodes in the forest.C. Total no. of nodes which have only right child.D. Return max element among all...