In computer science, priority queues are an often used data structure to
get objects by a certain priority in short time. Because of this,
improvements in this section still have a high relevance. Several
researches try to get these data structures more efficient or just simpler
than the known ones. For this purpose different approaches are pursued.
These range from more dynamic structures to heaps with multiple parts.This
work describes and analyses the ideas of several authors from the years
2005 to 2010 and compares some of them by practical examples.The algorithms
differ in the tree-structures they are based on or by the variability of
these structures. While some of them use a fixed structure with some
markings, other structures may vary in limited or nearly unlimited way.