Segments on the Right Branch of a Binary Tree

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:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-01
1. Verfasser: Lindenstrauss, Naomi
Format: Artikel
Sprache:eng
Schlagworte:
Segments
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
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\)
ISSN:2331-8422