It will take O(1)
check this => http://stackoverflow.com/questions/7650917/oklogk-time-algorithm-to-find-kth-smallest-element-from-a-binary-heap
are you sure for first one it is O(logn)
If we will go with simple procedure like 1+2+3+....2^n-1 comaprison to find nth smallest element then it is O(1)
another one is start deleting the element till kth level to reach the kth smallest element which is O(logn)
because everywhere I am seeing O(1) as well O(logn) time...can u plz confirm?? even I am bit confuse
Step 0: Study the topic/subject. Use Bikram ...