Question

what is the maximum and minimum size of an array to store a binary tree of n nodes

Answer 1

min = n

max = $2^n -1$

Comments

I think you are correct, but everywhere it is answered that minimum size is 2ⁿ -1.

But how that is possible.

Please verify the sources and confirm.

This question is similar to a 1 mark question in gate 2006

Answer 2

First when we say minimum size required we have to consider the worst case. Minimum size of an array to store 'n' nodes is 2n−1. Now coming to max size, there is nothing like max size... Max size can be anything more than 2n−1.. Even we can take very very huge size of an array and there does not exist an upper bound on that.
SO Min Size = 2n−1.
Max size = > 2n−1.