Ordered trees and the inorder traversal

DOI10.1016/j.disc.2006.03.044zbMath1100.05020OpenAlexW2016355174MaRDI QIDQ2502899

Ioannis Tasoulas, Panagiotis Tsikouras, Aristidis Sapounakis

Publication date: 13 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.044

zbMATH Keywords

Dyck pathsdominating sequences

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items

On pattern-avoiding Fishburn permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerations of ordered trees
• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Restricted plane tree representations of four Motzkin-Catalan equations
• Dyck path enumeration
• On numbers of Davenport-Schinzel sequences
• A new bijection between ordered trees and legal bracketings
• Efficient algorithms for tree reconstruction
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• Loopless Generation of Trees with Specified Degrees
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Correspondences between plane trees and binary sequences
• Motzkin numbers