Note
A Bijection on Ordered Trees and Its Consequences☆

https://doi.org/10.1006/jcta.1999.3027Get rights and content
Under a Creative Commons license
open archive

Abstract

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.

Keywords

ordered trees
bijection
degree of a node
level of a node

Cited by (0)

☆

Communicated by the Managing Editors

f1

E-mail: [email protected]

Copyright © 2000 Published by Elsevier Inc. All rights reserved.