Uniform distribution modulo one and binary search trees
From MaRDI portal
Sorting a sequence \(x=(x_k)\) of distinct numbers from \([0,1]\) by Quicksort generates a binary tree. Let \(H_n(x)\) denote the height of the tree generated by the prefix \(x_1,\dots,x_n\) of length \(n\) of \(x\). In the present paper it is shown that, if \(x\) is uniformly distributed in \([0,1]\), then \(H_n(x)=o(n)\) as \(n\to \infty\).
Recommendations
Cites work
- A note on the height of binary search trees
- A study of random Weyl trees
- Asymptotical growth of a class of random trees
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 1552323 (Why is no real title available?)
- scientific article; zbMATH DE number 3997916 (Why is no real title available?)
- Quicksort
- Renormalisation of curlicues
- Uniform distribution modulo one: a geometrical viewpoint.
This page was built for publication: Uniform distribution modulo one and binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558117)