On the total heights of random rooted binary trees
type: Item
instance of: scholarly article
title: On the total heights of random rooted binary trees
zbMATH Open document ID: 0809.05085
author: Lajos Takács
published in: Journal of Combinatorial Theory. Series B
publication date: 1994-09-13T00:00:00Z
review text: The height of a vertex in a rooted binary tree is the distance from the vertex to the root. The total height of a rooted binary tree is the sum of the heights of its vertices. This paper computes the distribution and moments of the height of a rooted binary tree chosen uniformly at random from the set of all such trees with \(n\) unlabelled vertices. The study of such a random variable is motivated by applications in computer science and neuroscience. Previous papers on the subject focused only on the mean height of rooted binary trees.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 638657
zbMATH Keywords: random trees
zbMATH Keywords: height of a vertex
zbMATH Keywords: rooted binary tree
reviewed by: Rakesh V. Vohra
MaRDI profile type: Publication
full work available at URL: jctb.1994.1041
OpenAlex ID: W2025804280
DOI: 10.1006/JCTB.1994.1041
description: scientific article; zbMATH DE number 638657