Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
RESEARCHCONTRIBUTIONS Programming
 

Summary: RESEARCHCONTRIBUTIONS
Programming
Techniques
and Data Structures
Min-Max Heaps and
Ian Munro
Editor
Generalized Priority Queues
M. D. ATKINSON,J.-R. SACK,N. SANTORO,and T. STROTHOTTE
ABSTRACT: ,4 simple implementation of double-
endedpriority queues is presented. The proposed
structure, called a min-max heap, can be built in linear
time; in contrast to conventional heaps, it allows both
FindMin and FindMax to be performed in constant
time; Insert, DeleteMin, and DeleteMax operations can
beperformed in logarithmic time.
Min-max heaps can begeneralized to support other
similar order-statistics operations efficiently (e.g.,
constant time FindMedian and logarithmic time
DeleteMedian); furthermore, the notion of min-max

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago
Santoro, Nicola - School of Computer Science, Carleton University

 

Collections: Computer Technologies and Information Sciences