@nbro afaik there is a tree and heap (two structures at once) to keep time logarithmic. This is a bit implementation specific, that said, when you read available implementations or books they differ vastly (different assumptions and implementations take place). Since you do not want to implement it and understand the apgorithm, I think that reading implementations (say on rosetta code) might be beneficial.
@nbro asking once more unanswered question is bad, it is better to edit it or make bounty. If your question is not covered, that is a different question you might ask. Besides, this chat is not as lively as main site. If you post question there, there are literally hundreds of people more, so chances are higher.
