The priority queue discussed in this talk is an abstract data type supporting theoperations INSERT and DELETEMIN, which transforms an input permutation σ oflength n to an output permutation τ . Atkinson and Thiyagarajah [2] proved that suchpairs (σ, τ) are counted by (n + 1)n−1. This is also well known as Cayley’s formulain graph theory, which counts the number of labeled trees ...