Last Minute Notes
Github
Docs
Learn
Search
⌘
K
@sayanstwt
Lessons
Learn
/
Data Structures & Algorithms
/
Trees & Heaps
Two Heaps
8 min
Advanced
8 steps
Keep a running median with a max-heap and a min-heap.
Added
5
Shifted
0
sorted insert is O(n)
median
5
5
new
current
visited
done
In this lesson
Step 1 of 8
1
The problem
2
Two halves
3
Add 5
4
Add 15
5
Add 1, 3
6
IPO
7
Pitfalls
8
Recap