English

Segments on the Right Branch of a Binary Tree

Combinatorics 2021-01-14 v1

Abstract

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 k2k+1\frac{k}{2^{k+1}} as n tends to \infty

Keywords

Cite

@article{arxiv.2101.05180,
  title  = {Segments on the Right Branch of a Binary Tree},
  author = {Naomi Lindenstrauss},
  journal= {arXiv preprint arXiv:2101.05180},
  year   = {2021}
}

Comments

4 pages

R2 v1 2026-06-23T22:07:47.321Z