Design a data structure that supports adding numbers and finding the median of all added elements.
Input: addNum(1), addNum(2), findMedian() -> 1.5, addNum(3), findMedian() -> 2
Output: 2
Topics: heap
Asked by: Google, Amazon, Meta
Time complexity: O(n). Space complexity: O(n).