- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
Data Structures | Queue | Question 5
Last Updated :
Discuss
Comments
A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.
Array
Linked List
Heap Data Structures like Binary Heap, Fibonacci Heap
None of the above
This question is part of this quiz :
Top MCQs on Queue Data Structure with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy