Lazy deletion

Home > Computer Science > Algorithms and data structures > Heaps and Priority Queues > Lazy deletion

A technique used to remove elements from priority queues lazily (i.e., not actually removing them). This makes it possible to remove elements while maintaining the heap property.