title: O(k) algorithm to find kth min element from a min heap
body: <p>o(klogn) solution is trivial to find the kth minimum.And here <a href="https://stackoverflow.com/questions/7650917/oklogk-time-algorithm-to-find-kth-smallest-element-from-a-binary-heap">O(klogk) time algorithm to find kth smallest element from a binary heap</a>  is a O(klogk) solution. But i was thinking of an algo which could be o(k) if correct . From the min heap,take the first k elements(first k nodes,traverse level wise ) and store them in an array .Now max heapify this array bottom-up which would take o(k) time.The root of this heap would be the required answer.Can anyone see a flaw in this algorithm?</p>