Deepest Nodes in Marked Ordered Trees
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 functi...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2022-09-01
|
| Series: | Annales Mathematicae Silesianae |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/amsil-2022-0015 |