Effective splaying with restricted rotations

DOI10.1080/00207160701435219zbMath1140.68015OpenAlexW2059003106MaRDI QIDQ3506250

Joan M. Lucas

Publication date: 12 June 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701435219

zbMATH Keywords

binary treedata structuressplay treerestricted rotations

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items

Root-restricted Kleenean rotations, Unnamed Item, Weak associativity and restricted rotation

Cites Work

• On rotations in fringe-balanced binary trees
• Right-arm rotation distance between binary trees
• Bounding restricted rotation distance
• On the deque conjecture for the splay algorithm
• Restricted rotation distance between binary trees.
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• A direct algorithm for restricted rotation distance
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Enumerating, Ranking and Unranking Binary Trees
• Self-adjusting binary search trees
• Short notes: Some Properties of the Rotation Lattice of Binary Trees
• Dynamic Binary Search
• General Balanced Trees
• An efficient algorithm for estimating rotation distance between two binary trees
• Binary Search Trees of Bounded Balance
• Relaxed balance using standard rotations