Practice
Learn
← Quit
0 / 0 correct
Data Structures
Easy
1 of 882
For a binary min-heap, what are the costs of peek-min and insert?
A
O(log n) and O(1)
B
O(n) and O(log n)
C
O(1) and O(1)
D
O(1) and O(log n)