On the joint distribution of the insertion path length and the number of comparisons in search trees

DOI10.1016/0166-218X(88)90080-7zbMath0673.68044MaRDI QIDQ1121028

Hosam M. Mahmoud, Boris G. Pittel

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

asymptotic propertiesnumber of comparisonsm-ary search tree

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

On random cartesian trees ⋮ Corrigendum ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ On the average internal path length of m-ary search trees

Cites Work

• On growing random binary trees
• On the Most Probable Shape of a Search Tree Grown from a Random Permutation
• Unnamed Item

This page was built for publication: On the joint distribution of the insertion path length and the number of comparisons in search trees