in DS recategorized by
603 views
1 vote
1 vote

Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element?

  1. $2$
  2. $3$
  3. $4$
  4. $5$
in DS recategorized by
603 views

2 Answers

1 vote
1 vote

Shaded positions can be occupied by the third-smallest element.
 

1 vote
1 vote

Ans = 5

Answer:

Related questions