1 votes 1 votes Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element? $2$ $3$ $4$ $5$ DS goclasses2023-iiith-mock-1 goclasses data-structures binary-heap 1-mark + – GO Classes asked Mar 26, 2023 • recategorized Apr 8, 2023 by Lakshman Bhaiya GO Classes 709 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Shaded positions can be occupied by the third-smallest element. GO Classes answered Apr 8, 2023 GO Classes comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Ans = 5 Mukulvyas answered Apr 26, 2023 Mukulvyas comment Share Follow See all 0 reply Please log in or register to add a comment.