Skip Navigation

The Computer Journal 1986 29(1):36-37; doi:10.1093/comjnl/29.1.36
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mahmoud, H. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Expected Distribution of Degrees in Random Binary Search Trees

H. M. Mahmoud *

The George Washington University, Department of Statistics, Washington DC 20052, USA

Let Vi be the set of vertices of degree, i, i=1,2,3, in a random binary search tree. We prove that E(|Vi|)=n|3+0(1), for i=1,2,3. This result tells us that the expected tree shape does not contain very long path subgraphs; thus in a sense the expected shape tends to be balanced.

Received February 1984.

* The George Washington University, Department of Statistics, Washington DC 20052, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.