- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- With what data structure can a priority ...

Q. |
## With what data structure can a priority queue be implemented? |

A. | Array |

B. | List |

C. | Heap |

D. | Tree |

Answer» D. Tree |

View all MCQs in:
Data Structures (DS)

- In a circular queue, how do you increment the rear end of the queue?
- Which of the following is not an application of priority queue?
- What is the time complexity to insert a node based on key in a priority queue?
- Which of the following is not an advantage of priority queue?
- What is the time complexity to insert a node based on position in a priority queue?
- A normal queue, if implemented using an array of size MAX_SIZE, gets full when
- Which of the following data structure is linear data structure?
- _________is not the operation that can be performed on Queue.
- A queue follows
- Circular Queue is also known as

Login to Continue

It will take less than 2 minutes

Report MCQ