Algorithms and Data Structures
From MaRDI portal
Publication:5394233
DOI10.1007/11534273zbMath1161.68395MaRDI QIDQ5394233
Linda Pagli, Antonio Mesa Enriquez, Fabrizio Luccio, Alejandro Almeida Ruiz
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Data structures; AVL tree; Binary tree; Rotation; Design of algorithms; Rotation distance; Search tree; Rebalancing
Related Items
A metric for rooted trees with unlabeled vertices based on nested parentheses, Efficient lower and upper bounds of the diagonal-flip distance between triangulations, Refined upper bounds for right-arm rotation distances, Weak associativity and restricted rotation