GATE CS 2003 | Question 23 | GATE CS PYQs | GATE CS Solutions | Data Structures (Min - Heap)

Question: In a min-heap with n elements with the smallest element at the root, the 7th smallest element can be found in time
A. Θ(nlogn)
B. Θ(n)
C. Θ(logn)
D. Θ(1)
#GATECS2003 #DataStructures #MinHeap

[@daniyajijo1437]

Good

[@theweakmaybegoodbuttheys-oh3zo]

" saa mohhrtd zidy foe " decode this cypher and comment weather u agree or not