Mortal
发表于 2025-4-1 04:24:12
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
特征
发表于 2025-4-1 07:19:19
http://reply.papertrans.cn/16/1532/153144/153144_62.png