On the total heights of random rooted binary trees (Q1333336): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1994.1041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025804280 / rank | |||
Normal rank | |||
Latest revision as of 19:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the total heights of random rooted binary trees |
scientific article |
Statements
On the total heights of random rooted binary trees (English)
0 references
13 September 1994
0 references
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.
0 references
random trees
0 references
height of a vertex
0 references
rooted binary tree
0 references
