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 . Also the fraction of trees with k segments on the right branch from all trees of size n tends to as n tends to
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.