Segments on the Right Branch of a Binary Tree
It is proved that the average number of segments on the right branch of a binary tree of size n tends to 3 as n tends to $\infty$. Also the fraction of trees with k segments on the right branch from all trees of size n tends to $\frac{k}{2^{k+1}}$ as n tends to $\infty$
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | It is proved that the average number of segments on the right branch of a
binary tree of size n tends to 3 as n tends to $\infty$. Also the fraction of
trees with k segments on the right branch from all trees of size n tends to
$\frac{k}{2^{k+1}}$ as n tends to $\infty$ |
|---|---|
| DOI: | 10.48550/arxiv.2101.05180 |