1 votes 1 votes closed as a duplicate of: Binary tree Made-easy-test-series The minimum size that an array may require to store a binary tree with n nodes (A) 2celi(log2(n+1))-1 (B)2n-1 (C)2n-n+1 (D)n+1 answer given by them is option A. but I think it should be B. Please clear my doubt Nashreen Sultana asked Dec 25, 2016 • closed Jul 16, 2019 by Satbir Nashreen Sultana 678 views comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Akriti sood commented Dec 25, 2016 reply Follow Share yess,if maximum asked then 2n -1 0 votes 0 votes rishu_darkshadow commented Sep 18, 2017 reply Follow Share bt in case of minimum it should be 'n' ..isn't it ? 0 votes 0 votes Nandkishor3939 commented Jul 15, 2019 reply Follow Share if you solve option a u will get it as n; as 2 ^ log a base 2 = a 0 votes 0 votes Please log in or register to add a comment.