Madeeasy test sries closed

Question

The minimum size that an array may require to store a binary tree with n nodes

(A) 2^{celi(log₂(n+1))}-1

(B)2ⁿ-1

(C)2ⁿ-n+1

(D)n+1

answer given by them is option A. but I think it should be B. Please clear my doubt

Comments

yess,if maximum asked then 2ⁿ -1

---

bt in case of minimum it should be 'n' ..isn't it ?

---

if you solve option a u will get it as n;

as 2 ^ log a base 2 = a