Binary search trees with binary comparison cost

DOI10.1007/BF00978710MaRDI QIDQ3335002zbMATH OpenFDO

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

Publication date 1984

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

Full work available at URL https://doi.org/10.1007/BF00978710

zbMATH Keywords

balanced biased treesbalanced search treesbinary search treesbinary treescomparison costFibonacci treesheight-balanced treesnode visit coststratified trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Expected Costs in Some Classes of Binary Search Trees
• On binary search trees
• Biased Search Trees
• Optimal search trees using two-way key comparisons
• Optimum lopsided binary trees

Cites work

• Bounds for optimalα-β binary trees
• scientific article; zbMATH DE number 3868632 (Why is no real title available?)
• scientific article; zbMATH DE number 3750305 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• scientific article; zbMATH DE number 3639124 (Why is no real title available?)
• Stratified balanced search trees

Cited in

(13)

• Operations research applications of dichotomous search
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Expected Costs in Some Classes of Binary Search Trees
• Biased Search Trees
• scientific article; zbMATH DE number 3909754 (Why is no real title available?)
• Two New Kinds of Biased Search Trees
• scientific article; zbMATH DE number 1754613 (Why is no real title available?)
• Optimum lopsided binary trees
• Binary search trees: How low can you go?
• Parameterizing the hardness of binary search tree access sequences by inversion counts
• A new weight balanced binary search tree
• Skewed Binary Search Trees
• Optimal binary search trees

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

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