Add template for solution with heap for Find Median from Data Stream

Author: KwonNayeon

find-median-from-data-stream/KwonNayeon.py

@@ -4,6 +4,8 @@
 - There will be at least one element in the data structure before calling findMedian.
 - At most 5 * 10^4 calls will be made to addNum and findMedian.
 
+<Solution 1: 리스트 활용>
+
 Time Complexity: 
 - addNum(): O(nlogn)
   - 매번 정렬하기 때문
@@ -41,3 +43,15 @@ def findMedian(self) -> float:
             mid2 = self.nums[n // 2]
             return (mid1 + mid2) / 2.0
 
+"""
+<Solution 2: 힙 활용>
+
+Time Complexity: 
+
+Space Complexity: 
+
+풀이방법:
+
+"""
+from heapq import heappop, heappush
+