MCQs>IT & Programming>C++>Which STL class is the best fit for implementing a collection of data that is always ordered so that the pop operation always gets the greatest of the elements? Suppose you are interested only in push and pop operations.
C++ MCQs
Which STL class is the best fit for implementing a collection of data that is always ordered so that the pop operation always gets the greatest of the elements? Suppose you are interested only in push and pop operations.
Answer
Correct Answer: Std::priority_queue
Explanation:
Note: This Question is unanswered, help us to find answer for this one