Some average measures in m-ary search trees

DOI10.1016/0020-0190(87)90215-8zbMath0653.68058OpenAlexW2043264962MaRDI QIDQ1108026

Ricardo A. Baeza-Yates

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90215-8

zbMATH Keywords

data structuressearch treestorage performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (6)

On rotations in fringe-balanced binary trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ The total path length of split trees ⋮ Dependence and phase changes in random m‐ary search trees ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees

Cites Work

• Unnamed Item
• On the average internal path length of m-ary search trees
• Height balance distribution of search trees
• On random 2-3 trees
• The analysis of a fringe heuristic for binary search trees
• Kantorovich-Type Inequalities
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: Some average measures in m-ary search trees