Greedy binary search trees are nearly optimal

DOI10.1016/0020-0190(81)90143-5zbMath0484.68047OpenAlexW2112198603MaRDI QIDQ1163867

James F. Korsh

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90143-5

zbMATH Keywords

analysis of algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms in computer science (68W99)

Cites Work

• Nearly optimal binary search trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy binary search trees are nearly optimal