Update 295_find_median_from_data_stream.md

Author: Joseph Luce

leetcode/hard/295_find_median_from_data_stream.md

@@ -46,6 +46,8 @@ You can think of this as a divide and conquer approach.
 The only tricky part is to keep the two heaps balanced, balanced meaning the two heaps cannot differ in size by more than 1.
 Secondly, we need to keep the two heap property of smaller and larger sets.
 
+Once these two properties are met, finding the median can be done by using the two values on top of the heap if both heap sizes are the same or taking the top value of the larger heap.
+
 ```
 class MedianFinder: