Binary tree

Question

Consider the binary tree where the number of nodes in each left sub-tree is within a factor of 2 of the number of nodes in the corresponding right sub-tree. Also, a node is allowed to have only one child if that child has no children. What will be the minimum number of nodes in such a tree with a height of 5? (root is at a height of 1).

Comments

https://gateoverflow.in/311536/made-easy-test-series-binary-tree?show=311536

---

using this formula ans is 25 but this question ans is 12 . and please help me in this question and if you find ans then you send me pic of binary tree.

---

---

but bro in this ans condition is not satisfied beacuse in the question it give the left sub-tree is within a factor of 2 of the number of nodes in the corresponding right sub-tree in this ans the right sub tree contain 7 node when left subtree contain 4 so 4 is not factor of this so what i do?

---

With in factor of 2.

But not exactly factor of 2.

 

At height 1, no.of nodes at left is 0 but right is 1 - this is due to one more condition given in the question.

---

Sir, why can't a right-skewed tree be answer?

Because in it, there is no left subtree for any node, that is within the factor of 2 of the number of nodes in the corresponding right sub-tree?

---

a node can have only one child if that child has no children:- 

acc to this statement if any node having a leaf as a children then that node must have only one child.

now here root is having 2 child and one of them is leaf, so isn't it invalid. for h=3

@Shaik Masthan please confirm it

Answer 1

13