Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost

DOI10.1137/S0097539793250329MaRDI QIDQ4210123zbMATH OpenOpenAlexFDO

Authors Tony W. Lai, D. Wood

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793250329

zbMATH Keywords

self-organizationcompetitive ratioadaptivitybinary search treesself-adjustmentconstant linkage costexpected amortization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Path balance heuristic for self-adjusting binary search trees
• Self-adjusting binary search trees
• Self-adjusting binary search trees: what makes them tick?
• Efficient reorganization of binary search trees

Cited in

(1)

• Path balance heuristic for self-adjusting binary search trees

This page was built for publication: Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210123)