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 427 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments 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.
log$2^{log_{2}(n+1)} -1$
2^{n}-1
