EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
From MaRDI portal
Publication:3430661
DOI10.1017/S026996480707009XzbMath1112.68034MaRDI QIDQ3430661
Nabil Lasmar, Rafik Aguech, Hosam M. Mahmoud
Publication date: 23 March 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Data structures (68P05)
Related Items (2)
On the distribution of distances between specified nodes in increasing trees ⋮ On weighted depths in random binary search trees
Cites Work
- On growing random binary trees
- Branching processes in the analysis of the heights of trees
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- The height of a random binary search tree
- A note on the height of binary search trees
- Distances and Finger Search in Random Binary Search Trees
- The variance of the height of binary search trees
This page was built for publication: EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
