Bucket Heap

Home > Computer Science > Algorithms and data structures > Heaps and Priority Queues > Bucket Heap

A bucket heap is a type of heap that is used when the range of the priority values is known in advance. The priority values are divided into several buckets, and a linked list of elements is stored in each bucket. It is used when the range of keys is small and known in advance.