Loading visualizer…
Min and max heaps for priority-based access — used in scheduling, graph algorithms, and top-K problems.