Binary search trees with binary comparison cost

DOI10.1007/BF00978710zbMATH Open0545.68056MaRDI QIDQ3335002FDOQ3335002

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)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stratified balanced search trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for optimalα-β binary trees
• Title not available (Why is that?)

Cited In (12)

• Two New Kinds of Biased Search Trees
• 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
• Binary search trees: How low can you go?
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Biased Search Trees
• Operations research applications of dichotomous search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expected Costs in Some Classes of 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)