Path balance heuristic for self-adjusting binary search trees

DOI10.1007/3-540-60692-0_59zbMath1354.68235OpenAlexW1536590737MaRDI QIDQ2956694

Venkatesh Raman, R. Balasubramanian

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_59

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (3)

Self-Adjusting Binary Search Trees: What Makes Them Tick? ⋮ Unnamed Item ⋮ Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying

This page was built for publication: Path balance heuristic for self-adjusting binary search trees