Bottom-up rebalancing binary search trees by flipping a coin

•Space efficient binary search trees.•Randomized rebalancing schemes.•Experimental evaluartion of rebalancing heuristics. Rebalancing schemes for dynamic binary search trees are numerous in the literature, where the goal is to maintain trees of low height, either in the worst-case or expected sense....

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1055; p. 115543
Main Author:	Brodal, Gerth Stølting
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.11.2025
Subjects:	Binary search tree Insertions Random rebalancing Binary search tree Random rebalancing Insertions
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!