A simple bijection between binary trees and colored ternary trees

2008/05/09 by Yidong Sun, Sun, Yidong
Mathematics · #05A19 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A19

paper · pdf · doi:10.48550/arxiv.0805.1279

4 pages, 2 figures

arxiv created 2008/05/09 · arxiv updated 2009/12/01

Abstract

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

Related

• Bijective Proofs of Identities from Colored Binary Trees
• Variations of the Catalan numbers from some nonassociative binary operations
• A derivation of the Catalan numbers from a bijection between permutations and labeled trees
• A bijection between ternary trees and a subclass of Motzkin paths
• Equivalence Classes Induced by Binary Tree Isomorphism -- Generating Functions