Path Length of Binary Search Trees

DOI10.1137/0122024zbMath0239.94009OpenAlexW2160178218MaRDI QIDQ5650276

No author found.

Publication date: 1972

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0122024

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (6)

Operations research applications of dichotomous search ⋮ Testing the optimality of alphabetic trees ⋮ Optimal binary search trees ⋮ A fast and space-economical algorithm for length-limited coding ⋮ Least upper bound on the cost of optimum binary search trees ⋮ Monotonicity and efficient computation of optimal dichotomous search

This page was built for publication: Path Length of Binary Search Trees