Weight biased leftist trees and modified skip lists

Abstract

We propose the weight biased leftist tree as an alternative to traditional leftist trees [2] for the representation of mergeable priority queues. A modified version of skip lists [5] that uses fixed size nodes is also proposed. Experimental results show our modified skip list structure is faster than the original skip list structure for the representation of dictionaries. Experimental results comparing weight biased leftist trees and competing priority queue structures are presented.

This research was supported, in part, by the Army Research Office under grant DAA H04-95-1-0111, and by the National Science Foundation under grant MIP91-03379.