Any ideas about a serious advantage of a heap over a balanced BST?
I see that heap can be implemented in an array, and the code is simpler. Fine, that's something.
Does anybody see any big advantage of heaps over balanced BSTs?
(If we cache the maximum in a BST we have the same O(1) getMax operation. )