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
Language: English
Page range: 215 - 227
Submitted on: Feb 17, 2022
Accepted on: Aug 16, 2022
Published on: Sep 8, 2022
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2022 Helmut Prodinger, published by University of Silesia in Katowice, Institute of Mathematics
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.