Question 8471 – Algorithms
May 13, 2024Queues-and-Stacks
May 14, 2024Question 11786 – Queues-and-Stacks
Which one of the following is a Meldable priority queue?
Correct Answer: B
Question 7 Explanation:
The classic way to implement a priority queue is using a data structure called a binary heap. A binary heap will allow us to enqueue or dequeue items in O ( log n ).
Leftist Heap
Binary Heap
AVL trees
Red – Black trees
Subscribe
Login
0 Comments