def insert(self, num):
        if not self.min_h or num > self.min_h[0]:
            heapq.heappush(self.min_h, num)
        else:
            heapq.heappush(self.max_h, -num)
        self.balance()
dataset/ETHPy150Open algorhythms/LeetCode/295 Find Median from Data Stream.py/DualHeap.insert/original