The Analysis of a Practical and Nearly Optimal Priorty Queue

Abstract : The properties of the binomial queue, a new data structure for implementing priority queues that can be efficiency merged are explored in detail. New methods of representing binomial queues are given which reduce the storage overhead of the structure and increase the efficiency of operations on it. One of these representations allows any element of an unknown priority queue to be deleted in log time, using only two pointers per element of the queue. A complete analysis of the average time for insertion into and deletion from a binomial queue is performed. This analysis is based on the result that the distribution obtained after repeated insertions and deletions.