Oris
Today
Universe
Explore
Studio
Authors
Account
Урок 1 из 8
What is the time complexity of inserting into, or extracting the top from, a binary-heap priority queue?
O(log n)
O(1)
O(n)
O(n log n)
Проверить
Today
Universe
Explore
Profile