A NEW WEIGHT BALANCED BINARY SEARCH TREE

DOI10.1142/S0129054100000296zbMath1320.68058OpenAlexW1984738873MaRDI QIDQ5249052

Seonghun Cho, Sartaj K. 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)

Related Items (1)

EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS

Cites Work

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

This page was built for publication: A NEW WEIGHT BALANCED BINARY SEARCH TREE