madeasy test series

Question

The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______.

A    log$2^{log_{2}(n+1)} -1$

B 2^{n}-1

C  n + 1

Comments

Answer should be 2ⁿ -1

Because when tree is skewed : 

1st element at position 1

2nd element at position 3

3rd element at position 7. .... and so on

hence ans should be option B 

---

ya did the same but in test series answer is given as option a and it is previously solved in gateoverflow with option a

---

You have some typing mistake for option A: it would be(2^(logn+1))-1 and this would be the right answer

B cannot be the right answer..Because minimum is asked not maximum.. If we have questions asked for maximum then we should go for skew assumption..

---

yes for min can not take worst structure

---

Ohk I got the mistake . Thanks @vamp_vaibhav