2-Binary trees: Bijections and related issues

Nancy S.S. Gu, Nelson Y. Li, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of enumeration results with respect to certain statistics.

Original languageEnglish
Pages (from-to)1209-1221
Number of pages13
JournalDiscrete Mathematics
Issue number7
StatePublished - 6 Apr 2008


  • Binary tree
  • Dyck path
  • Motzkin path
  • Non-crossing tree
  • Schröder path
  • Ternary tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of '2-Binary trees: Bijections and related issues'. Together they form a unique fingerprint.

Cite this