The average height of binary trees and other simple trees
type: Item
instance of: scholarly article
title: The average height of binary trees and other simple trees
zbMATH Open document ID: 0499.68027
DOI: 10.1016/0022-0000(82)90004-6
author: Philippe Flajolet
author: Andrew Odlyzko
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
full work available at URL: RR-0056.pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3788011
zbMATH Keywords: expected stack height
zbMATH Keywords: analytic behaviour of a generating function
zbMATH Keywords: contour integration
zbMATH Keywords: limiting distribution of height
MaRDI profile type: Publication
OpenAlex ID: W2168559467
cites work: Asymptotic Methods in Enumeration
cites work: Q3845448
cites work: Q5659554
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: The number of registers required for evaluating arithmetic expressions
cites work: Q3888542
cites work: The average number of registers needed to evaluate a binary tree optimally
cites work: Q3050452
cites work: Q5585020
cites work: Q4057549
cites work: On the Altitude of Nodes in Random Trees
cites work: On the Order of Random Channel Networks
cites work: Periodic oscillations of coefficients of power series that satisfy functional equations
cites work: On the height of trees
cites work: The Enumeration of Trees by Height and Diameter
description: scientific article; zbMATH DE number 3788011