A Bijection on Ordered Trees and Its Consequences
Emeric Deutsch · Journal of Combinatorial Theory Series A · 2000
A bijection is introduced in the set of all ordered trees having n edges from which one derives that, for each positive integer q , the parameters “number of nodes of degree q ” and “number of odd-level nodes of degree q −1” are equidistributed.