GATE CSE
First time here? Checkout the FAQ!
x
0 votes
141 views

What should be output for $n = 8$??

asked in DS by Boss (8.6k points)   | 141 views

1 Answer

+2 votes

In the question it is clearly mentioned as "The minimum size of an array that it may require to store a binary tree with n nodes" , In this case you need to take the best case possible that is Balanced Complete Tree

The minimum size is required is 2Hieght of Tree-1

Hieght of Tree is Log2n+1 (If you take root is in hieght 0)

The minimum size is required is 2log2(n+1) -1

 

answered by Veteran (11.4k points)  
Ok, what would be minimum size of array to store $8$ elements?? Array of size 8 is sufficient to do that. but using formula in option A, says $2^4 -1 = 15$
question ask binary tree ryt :

Take Right skew tree. how much size needed for that. 15 for N= 8 ryte. since we have to consider we find parent by using child adreess. or child address using parent.

@abcd2 See we are not storing nodes in array in linear manner

Consider we are storing root node in ith location then the left child is stored in (2i)th position and right child of that node is stored in (2i+1)th position. This rule for array representation is true for each and every child.

@Anirudh if all $n$ nodes are right skewed? then it's not 15.
Does the question says any binary tree with $n$ nodes?

Yes it will take 15 . Heap is special case of binary Tree

http://quiz.geeksforgeeks.org/data-structures-binary-trees-question-22/



Top Users Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2734 Points

  5. Debashish Deka

    2592 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1342 Points

  9. Bikram

    1312 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,508 questions
26,832 answers
61,091 comments
23,146 users