Heap-ordered trees, 2-partitions and continued fractions

This paper studies the enumerations and some interesting combinatorial properties of heap-ordered trees (HOTs). We first derive analytically the total numbers of n-node HOTs. We then show that there exists a 1-1 and onto correspondence between any two of the following four sets: the set of (n+1)-node HOTs, the set of 2-partitions of Z(2n) = {1, 2,...,2n}, the set of Young tableaux from Z(2n) without odd-length columns, and the set of weighted paths of length 2n. These correspondences can not only be used to obtain the above enumeration quantities through combinatorial arguments, but can also relate their generating functions to continued fractions.