On the average number of rebalancing operations in weight-balanced trees

DOI10.1016/0304-3975(80)90018-3zbMath0435.68051OpenAlexW2017602223MaRDI QIDQ1140428

Norbert Blum, Kurt Mehlhorn

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90018-3

zbMATH Keywords

balanced treesinformation storage

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)

Related Items (13)

Making data structures persistent ⋮ Maintaining range trees in secondary memory. Part I: Partitions ⋮ Unnamed Item ⋮ Dynamic fractional cascading ⋮ Aspects of insertion in random trees ⋮ A new data structure for representing sorted lists ⋮ Dynamic deferred data structuring ⋮ Unnamed Item ⋮ Maintaining the minimal distance of a point set in polylogarithmic time ⋮ Maintaining multiple representations of dynamic data structures ⋮ Some Results for Elementary Operations ⋮ A NEW WEIGHT BALANCED BINARY SEARCH TREE ⋮ Maintaining order in a generalized linked list

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrency of operations on B-trees
• On random 2-3 trees
• Performance of height-balanced trees
• Binary Search Trees of Bounded Balance

This page was built for publication: On the average number of rebalancing operations in weight-balanced trees