scientific article; zbMATH DE number 3847416

MaRDI QIDQ3317124zbMATH OpenFDO

Authors Peter Kirschenhofer

Publication date 1983

zbMATH Keywords

expected heightrandom binary tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 4023312
• An analytic approach to the height of binary search trees
• The Distribution of Heights of Binary Trees and Other Simple Trees
• On the concentration of the height of binary search trees
• Moments of level numbers of leaves in binary trees

Cited in

(10)

• The asymptotic contour process of a binary tree is a Brownian excursion
• The asymptotic distribution of leaf heights in binary trees
• Moments of level numbers of leaves in binary trees
• Average-case analysis of quicksort and binary insertion tree height using incompressibility
• scientific article; zbMATH DE number 3904610 (Why is no real title available?)
• scientific article; zbMATH DE number 4023312 (Why is no real title available?)
• scientific article; zbMATH DE number 30754 (Why is no real title available?)
• A note on the height of binary search trees
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• Some new results on the average shape of binary trees and other simply generated families

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317124)