Heap and priority queue in .NET

PriorityQueue<T> usage

var pq = new PriorityQueue<int, int>();
pq.Enqueue(5, 5);
pq.Enqueue(3, 3);
pq.Enqueue(9, 9);
int top = pq.Peek();

Problems to practice

• Kth largest element
• Top K frequent elements
• Merge K sorted lists
• Median in stream

Interview guidance

A heap gives efficient top-element access and is often used for ordering under constraints.