Back to Questions

Implement a Priority Queue using a Heap

52.6K views•Asked at Microsoft•
Medium

Question Explain

Explain how a Binary Heap (Min or Max) is used to implement a Priority Queue. Describe the complexity of insertion and deletion operations.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Reverse a Linked List

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

74.7K views
Implement a Priority Queue using a Heap - Interview Question