The Complexity of Rebalancing a Binary Serach Tree

Rolf Fagerberg. The Complexity of Rebalancing a Binary Serach Tree. In C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings. Volume 1738 of Lecture Notes in Computer Science, pages 72-83, Springer, 1999. [doi]

Abstract

Abstract is missing.