Titlebook: Algorithms and Data Structures; 9th International Wo Frank Dehne,Alejandro López-Ortiz,J?rg-Rüdiger Sac Conference proceedings 2005 Springe

Mortal

k-Restricted Rotation with an Application to Search Tree Rebalancing only take place at the root of the tree, or at the right child of the root. A sharp upper bound ..(., .) ≤ 4n – 8 is known, based on the word metric of Thompson’s group. We refine this bound to a sharp ..(., .) ≤ 4n – 8 – . – ., where . and . are the numbers of vertices in the rightmost vertex chai

特征