The Number of m-ary Search Trees on n Keys

DOI10.1017/S0963548397003118MaRDI QIDQ4372991zbMATH OpenFDO

Authors James Allen Fill, Robert P. Dobrow

Publication date 25 May 1998

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

search trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10)

Recommendations

• m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
• Some average measures in m-ary search trees
• A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees
• On the height of random m‐ary search trees
• On the average internal path length of m-ary search trees

Cited in

(4)

• An application of $m$-ary trees to the design of data structures for geometric searching problems
• Degree profile of \(m\)-ary search trees: a vehicle for data structure compression
• m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
• Some average measures in m-ary search trees

This page was built for publication: The Number of m-ary Search Trees on n Keys

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