ALGO_CURCUIT
Toggle theme
Min-Max Heap
Query:
O(1)
Push:
O(log n)
Pop:
O(log n)
Min Heap
Max Heap
Push
Pop
Peek
Array
Tree
6
8
10
20
27
55
40
30
35
60
0
i =
0
(6)
left = 2 * i + 1 =
1
(8)
right = 2 * i + 2 =
2
(10)
