A note on the height of binary search trees
Journal of the ACM (JACM)
Branching processes in the analysis of the heights of trees
Acta Informatica
On the Variance of the Height of Random Binary Search Trees
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data Structures and Algorithms
Data Structures and Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An analytic approach to the height of binary search trees II
Journal of the ACM (JACM)
The Variance of the height of binary search trees
Theoretical Computer Science
An analytic approach to the height of binary search trees II
Journal of the ACM (JACM)
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
Theoretical Computer Science
Extremal Weighted Path Lengths In Random Binary Search Trees
Probability in the Engineering and Informational Sciences
Average case analysis for tree labelling schemes
Theoretical Computer Science
Smoothed analysis of binary search trees
Theoretical Computer Science
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient cluster-based group key agreement protocols for wireless ad hoc networks
Journal of Network and Computer Applications
Efficient certification path discovery for MANET
EURASIP Journal on Wireless Communications and Networking
MIDAS: multi-attribute indexing for distributed architecture systems
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Average case analysis for tree labelling schemes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Smoothed analysis of binary search trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information
Mobile Networks and Applications
| Hi-index | 0.01 |
Let Hn be the height of a random binary search tree on n nodes. We show that there exist constants α = 4.311… and β = 1.953… such that E(Hn) = αln n − βln ln n + O(1), We also show that Var(Hn) = O(1).