recategorized by
391 views
0 votes
0 votes

Consider a binary tree, where for every node P – Q ≤ 2, where P represents 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 nodes present in such a binary tree of height h =4 will be 

  1. 6
  2. 8
  3. 9
  4. None of these
recategorized by

1 Answer

0 votes
0 votes
Minimum 9 nodes required according to condition (left tree- right tree)..

Related questions

1 votes
1 votes
1 answer
1
Nishisahu asked Dec 25, 2021
1,183 views
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is di...
4 votes
4 votes
1 answer
3
2 votes
2 votes
3 answers
4