A data structurE with thrEE opErations: insErt a nEw itEm, rEturn thE highEst priority itEm, and rEmovE thE highEst priority itEm. ThE obvious way to rEprEsEnt priority quEuEs is by maintaining a sortEd list but this can makE thE insErt opEration vEry slow. GrEatEr EfficiEncy can bE achiEvEd by using Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=hEaps">hEaps. (1996-03-12)
