Retracted: Strong limiting behavior in binary search trees

Abstract

In a binary search tree of size n, each node has no more than two children, we denote the number of the node with κ children by ξn,k. In this paper, we study the strong limit behavior of the random variables ξn,k and σn,m, where σn,m represents the number of subtrees of size m. The results can imply some known results. © 2013 Chen and Peng; licensee Springer.