3 votes 3 votes Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero) DS goclasses2024-mockgate-13 goclasses numerical-answers data-structures binary-heap 1-mark + – GO Classes asked Jan 28 • retagged Jan 28 by Lakshman Bhaiya GO Classes 507 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply ShreyaWani commented Jan 29 reply Follow Share How the answer is 50? 0 votes 0 votes GO Classes Support commented Jan 31 reply Follow Share $ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$All India Mock Test 4 - Solutions Part 1 1 votes 1 votes Please log in or register to add a comment.
4 votes 4 votes We cannot place $60,$ there won't be any suitable child of $60.$ Hence, the largest could be $50.$ GO Classes answered Jan 28 • edited Jan 28 by Lakshman Bhaiya GO Classes comment Share Follow See all 0 reply Please log in or register to add a comment.
