0 votes 0 votes 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 eyeamgj asked Dec 2, 2017 • edited Dec 2, 2017 by eyeamgj eyeamgj 439 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Ashwin Kulkarni commented Dec 2, 2017 reply Follow Share Answer should be 2n -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 0 votes 0 votes eyeamgj commented Dec 3, 2017 reply Follow Share ya did the same but in test series answer is given as option a and it is previously solved in gateoverflow with option a 0 votes 0 votes vamp_vaibhav commented Dec 3, 2017 reply Follow Share 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.. 2 votes 2 votes abhishek tiwary commented Dec 3, 2017 reply Follow Share yes for min can not take worst structure 0 votes 0 votes Ashwin Kulkarni commented Dec 3, 2017 reply Follow Share Ohk I got the mistake . Thanks @vamp_vaibhav 1 votes 1 votes Please log in or register to add a comment.