Maximum, delete and insert fastest data structure
Posted by Rma, at cs.stackexchange.com,
The runtime to find a max element in max heap is $O(1)$. It takes $O(\log n)$ time to delete an element and $O(\log n)$ time to…
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery