Efficient reorganization of binary search trees

DOI10.1007/S00453-001-0057-ZMaRDI QIDQ5953106zbMATH OpenOpenAlexFDO

Authors Micha Hofri, Hadas Shachnai

Publication date 2 April 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0057-z

zbMATH Keywords

binary search tree

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• scientific article; zbMATH DE number 4064505
• scientific article; zbMATH DE number 2127725
• Lower Bounds for Accessing Binary Search Trees with Rotations
• Assembling approximately optimal binary search trees efficiently using arithmetics

Cited in

(8)

• Efficient selection on a binary tree
• Efficient multiway radix search trees
• On the Markov chain for the move-to-root rule for binary search trees
• scientific article; zbMATH DE number 5130543 (Why is no real title available?)
• scientific article; zbMATH DE number 4064505 (Why is no real title available?)
• Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost
• Average number of rotations access cost in iR-trees
• Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: Efficient reorganization of binary search trees

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