Binary search trees of almost optimal height
From MaRDI portal
Publication:911247
DOI10.1007/BF01237235zbMATH Open0696.68029OpenAlexW1971131533MaRDI QIDQ911247FDOQ911247
Authors: N. E. Zubov 
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01237235
Recommendations
- Optimal binary search trees
- Optimal binary search trees
- Height Restricted Optimal Binary Trees
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- A note on the height of binary search trees
- An analytic approach to the height of binary search trees
- Optimal alphabetic trees for binary search
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
- scientific article; zbMATH DE number 1741002
- An Approximation Algorithm for Binary Searching in Trees
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)
Cites Work
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The design of dynamic data structures
- Priority Search Trees
- Binary Search Trees of Bounded Balance
- Title not available (Why is that?)
- Organization and maintenance of large ordered indexes
- Updating a balanced search tree in 0(1) rotations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the relationship between son-trees and symmetric binary B-trees
- Stratified balanced search trees
- Implementing dictionaries using binary trees of very small height
- UPDATING BINARY TREES WITH CONSTANT LINKAGE COST
- Optimizing binary trees grown with a sorting algorithm
Cited In (27)
- Supernode Binary Search Trees
- Jump interpolation search trees and symmetric binary numbers
- Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
- On the Height of Multidimensional Height-Balanced Trees
- A subquadratic algorithm for constructing approximately optimal binary search trees
- Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
- A new weight balanced binary search tree
- Optimal alphabetic trees for binary search
- Optimal binary trees with order constraints
- Binary search tree recursions with harmonic toll functions
- Optimal binary search trees
- Optimal binary search trees
- Binary search trees: How low can you go?
- DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING
- Improving time and space efficiency in generalized binary search trees
- Title not available (Why is that?)
- The optimal binary search tree for Andersson's search algorithm
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Balanced search trees made simple
- Title not available (Why is that?)
- On \(k\)-dimensional balanced binary trees.
- Title not available (Why is that?)
- The Analysis of an Improved Symmetric Binary B-tree Algorithm
- Title not available (Why is that?)
- A note on the height of binary search trees
- Title not available (Why is that?)
- Almost optimal dynamic 2-3 trees
This page was built for publication: Binary search trees of almost optimal height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911247)
