A new weight balanced binary search tree

DOI10.1142/S0129054100000296MaRDI QIDQ5249052zbMATH OpenOpenAlexFDO

Authors Seonghun Cho, Sartaj Sahni

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054100000296

zbMATH Keywords

data structuresweight balanced binary search trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Balancing binary trees by internal path reduction
• scientific article; zbMATH DE number 3852445
• Binary search trees of almost optimal height
• Binary search trees with binary comparison cost
• scientific article; zbMATH DE number 1754613

Cites work

• Binary Search Trees of Bounded Balance
• On the average number of rebalancing operations in weight-balanced trees
• Performance of height-balanced trees

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)