Loopless Generation of Schroder Trees
James F. Korsh · The Computer Journal · 2003
The well-known Schröder numbers have appeared in different combinatorial contexts, including Schröder trees and well-weighted binary trees. The only loopless algorithm for generating Schröder trees actually generated representations for their well-weighted binary tree counterparts. This paper presents the first loopless algorithms for directly generating Schröder tree representations. They use a new loopless algorithm for generating $k$-compositions of $n$ in inverse lexicographic order.