A new weight balanced binary search tree
From MaRDI portal
Publication:5249052
Recommendations
Cites work
Cited in
(14)- Fibonacci BSTs: a new balancing method for binary search trees
- Supernode Binary Search Trees
- Two New Kinds of Biased Search Trees
- Balancing weight-balanced trees
- Weighted Binary Trees for Concurrent Searching
- Weighted Leaf AVL-Trees
- scientific article; zbMATH DE number 3881889 (Why is no real title available?)
- Balancing binary trees by internal path reduction
- Skewed Binary Search Trees
- A balanced search tree O(1) worst-case update time
- Balanced search trees made simple
- scientific article; zbMATH DE number 3852445 (Why is no real title available?)
- EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS
- scientific article; zbMATH DE number 1754613 (Why is no real title available?)
This page was built for publication: A new weight balanced binary search tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249052)