Tech_Interview_Prep

Heaps / Priority Queues

A tree-shaped structure that keeps the min (or max) element accessible in O(1), with O(log n) insert and remove.

Reference Q&A for this concept is coming soon.