0 votes 0 votes What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree DS ugcnetcse-june2010-paper2 data-structures priority-queue + – makhdoom ghaya asked Sep 15, 2016 • recategorized Oct 28, 2017 by Devshree Dubey makhdoom ghaya 5.9k views answer comment Share Follow See 1 comment See all 1 1 comment reply mcjoshi commented Sep 15, 2016 reply Follow Share Heap is the best implementation of Priority Queue. Read this and this 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes option A HEAP Shubham Pandey 2 answered Sep 16, 2016 Shubham Pandey 2 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (A) Heap ... Priority queue can be implemented using an array, a linked list, a heap data structure. Among these data structures, heap data structure provides an efficient implementation of priority queues. In a normal queue, queue is implemented based on FIFO but in priority queue nodes are removed based on the priority... Time complexity of priority queue using binary heap or binary search tree : 1. Insert operation takes : O( log n ).. 2. Delete operation takes : O (log n ) … Awe111 answered Nov 16, 2021 Awe111 comment Share Follow See all 0 reply Please log in or register to add a comment.