Partitions and normal trees (Q2276968)

This paper shows that a listing of the partitions of a natural number n (with parts listed in non-increasing order) in dictionary order corresponds to the post ordering of chains of a particular finite tree T[n] that belongs to the class of normal trees.