1 1 vote 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 Programming in C + – Nashreen Sultana 1.2k views comment Share Follow Print See all 6 Comments 6 6 Comments reply Prateek Yadav 2 commented Dec 25, 2016 reply Follow flag since it is given min so tree must be complete .By taking some example of comlete biinary tree you can elimminate options and only A option will give right answer Hope you get it!!!! 0 0 replyShare Nashreen Sultana commented Dec 25, 2016 reply Follow flag sorry didnt get it. please elaborate with an example 0 0 replyShare Nashreen Sultana commented Dec 25, 2016 reply Follow flag ok, ithink i got it. would they mention as maximum array size then it would hav been option B right? 0 0 replyShare Akriti sood commented Dec 25, 2016 reply Follow flag yess,if maximum asked then 2n -1 0 0 replyShare rishu_darkshadow commented Sep 18, 2017 reply Follow flag bt in case of minimum it should be 'n' ..isn't it ? 0 0 replyShare Nandkishor3939 commented Jul 15, 2019 reply Follow flag if you solve option a u will get it as n; as 2 ^ log a base 2 = a 0 0 replyShare Please log in or register to add a comment.
