median heap
A median heap is a data structure that combines the properties of a min-heap and a max-heap to efficiently find the median of a set of values. It stores the lower half of the values in a max-heap and the upper half in a min-heap. The median can be quickly retrieved by accessing the roots of the heaps. This allows for efficient insertion and deletion of elements while maintaining the median as the middle value.
Requires login.