Splaying preorders and postorders

DOI10.1007/978-3-030-24766-9_37OpenAlexW2966027757MaRDI QIDQ2285113FDOQ2285113

Authors: Caleb C. Levy, Robert E. Tarjan 

Publication date: 16 January 2020

Full work available at URL: https://arxiv.org/abs/1907.06309

Recommendations

• A new path from Splay to dynamic optimality
• Splaying a search tree in preorder takes linear time
• Sequential access in splay trees takes linear time
• A study on splay trees
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

zbMATH Keywords

pattern avoidancebinary search treesamortized time

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cited In (3)

• Postorder Preimages
• Special classes of positive preorders
• Pre-orders and Orders Generated by Conjunctive Uninorms

This page was built for publication: Splaying preorders and postorders

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