Exercises for the week 11 exercise session¶

Task 1¶

Think how you could maintain information about the median element of input data using heaps. Hint: You can use more than one heap. The solution should work efficiently, if the median is requested often, and new data elements are added between median requests.