I am wondering which is the most efficient way (minimal time complexity) to implement a heap (say heap-min). Heap mentioned here means a data structure letting us perform insertion, deletion and retrieving the minimum value on a collection of data.