What is the purpose and functionality of a median heap in data structures and algorithms?

A median heap is a data structure used to efficiently find the median value in a set of numbers. It combines the properties of a min heap and a max heap to quickly access the middle value. This is useful in algorithms that require finding the median, such as sorting algorithms and statistical analysis.