Back to Results
First PageMeta Content



The Height of a Random Binary Search Tree BRUCE REED McGill University, Montreal Quebec, Canada and CNRS, Paris, France Abstract. Let Hn be the height of a random binary search tree on n nodes. We show that there exist c
Add to Reading List

Document Date: 2003-09-12 14:05:29


Open Document

File Size: 227,31 KB

Share Result on Facebook