# $k^{th}$ smallest number in the Min-Heap - $O(k\log k)$ ![](https://i.imgur.com/XBY5C0G.png) ![](https://i.imgur.com/eglguvN.png)