Binary search trees with binary comparison cost

DOI10.1007/BF00978710zbMATH Open0545.68056MaRDI QIDQ3335002FDOQ3335002

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

Publication date: 1984

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

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

• Stratified balanced search trees
• Bounds for optimalα-β binary trees
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Optimal binary search trees
• Binary search trees: How low can you go?
• Operations research applications of dichotomous search
• Title not available (Why is that?)

   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 👍 👎

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)