Binary search trees with binary comparison cost

DOI10.1007/BF00978710zbMath0545.68056MaRDI QIDQ3335002

Thomas Ottmann, Arnold L. Rosenberg, Derick Wood, Hans-Werner Six

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

binary treesbinary search treesbalanced search treesheight-balanced treescomparison costnode visit costFibonacci treesstratified treesbalanced biased trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Operations research applications of dichotomous search ⋮ Optimal binary search trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stratified balanced search trees
• Bounds for optimalα-β binary trees

This page was built for publication: Binary search trees with binary comparison cost