I got HEAP DS as a ADT(abstract data type). Means i can perform few operations on it like getMin(),getMax(),deleteRoot() etc.
So if i have to get 2nd smallest in min heap then it will be in 2nd level definitely. so should i approach it as make a level order traversal and get it in O(1) time. or i should take it as standard way like delete root, hepify ,getRoot() ,insert() deleted item=O(2Logn) ?
I found a prev. gate question as find 7th min in min heap, and all answers are O(1).