Published: 2022-09-08

Deepest nodes in marked ordered trees

Helmut Prodinger Logo ORCID

Abstract

A variation of ordered trees, where each rightmost edge might be marked or not, if it does not lead to an endnode, is investigated. These marked ordered trees were introduced by E. Deutsch et al. to model skew Dyck paths. We study the number of deepest nodes in such trees. Explicit generating functions are established and the average number of deepest nodes, which approaches 5/3 when the number of nodes gets large. This is to be compared to standard ordered trees where the average number of deepest nodes approaches 2.

Download files

Citation rules

Prodinger, H. (2022). Deepest nodes in marked ordered trees. Annales Mathematicae Silesianae, 36(2), 215–227. Retrieved from https://journals.us.edu.pl/index.php/AMSIL/article/view/14553
Domyślna okładka

Vol. 36 No. 2 (2022)
Published: 2022-09-30


ISSN: 0860-2107
eISSN: 2391-4238
Ikona DOI 10.1515/amsil

Publisher
University of Silesia Press

This website uses cookies for proper operation, in order to use the portal fully you must accept cookies.