Retracted: Strong limiting behavior in binary search trees
From MaRDI portal
Publication:395794
DOI10.1186/1029-242X-2013-60zbMath1282.60028WikidataQ59301787 ScholiaQ59301787MaRDI QIDQ395794
Publication date: 30 January 2014
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
60F05: Central limit and other weak theorems
05C80: Random graphs (graph-theoretic aspects)
68P05: Data structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Left and right pathlengths in random binary trees
- Branching processes in the analysis of the heights of trees
- A note on the distribution of the three types of nodes in uniform binary trees
- Binary trees having a given number of nodes with 0, 1, and 2 children
- Constant bounds on the moments of the height of binary search trees
- An analytic approach to the height of binary search trees
- Distribution of distances in random binary search trees.
- A note on the distance in random recursive trees
- Limiting theorems for the nodes in binary search trees
- An analytic approach to the height of binary search trees II
- A note on the height of binary search trees
- On the concentration of the height of binary search trees
- Distances and Finger Search in Random Binary Search Trees
- The variance of the height of binary search trees