An analytic approach for the analysis of rotations in fringe-balanced binary search trees

This paper presents an analytic approach to the construction cost of fringe-balanced binary search trees. In 7], Mahmoud used a bottom-up approach and an urn model of Pólya. The present method is top-down and uses differential equations and Hwang's quasi-power theorem to derive the asymptotic normality of the number of rotations needed to construct such afringe balanced search tree. We also obtain the exact expectation and variance with this method. Although Pólya's urn model is no longer needed, we also present an elegant analysis of it based on an operator calculus as in 4].This research was supported by the Austrian Research Society (FWF) under the project number P12599-MAT.