On the average internal path length of m-ary search trees

DOI10.1007/BF00268078zbMath0567.68038OpenAlexW1971711520MaRDI QIDQ1060015

Hosam M. Mahmoud

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00268078

zbMATH Keywords

searchingrandom insertions

Mathematics Subject Classification ID

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

Related Items

Some average measures in m-ary search trees ⋮ A weakly 1-stable distribution for the number of random records and cuttings in split trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Dependence and phase changes in random m‐ary search trees ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ On the internal path length ofd-dimensional quad trees ⋮ The expected additive weight of trees

Cites Work

• On the joint distribution of the insertion path length and the number of comparisons in search trees
• On the Most Probable Shape of a Search Tree Grown from a Random Permutation
• Asymptotic Methods in Enumeration
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item