On random binary trees
Authors
Brown, Gerald G.
Shubert, Bruno O.
Advisors
Second Readers
Subjects
Binary Trees
Random Binary Trees
Insertion Tree Sorting
Binary Search Trees
Height of Random Trees
Asymptotic Random Trees
Counting Binary Trees
Recursive Enumeration of Trees
Vacancies in Binary Trees
Comparisons for Binary Insertion Sorting
Growing Binary Trees
Random Binary Trees
Insertion Tree Sorting
Binary Search Trees
Height of Random Trees
Asymptotic Random Trees
Counting Binary Trees
Recursive Enumeration of Trees
Vacancies in Binary Trees
Comparisons for Binary Insertion Sorting
Growing Binary Trees
Date of Issue
1976-06
Date
Publisher
Monterey, CA; Naval Postgraduate School
Language
Abstract
Binary Trees are examined combinatorially with the view of providing information useful in analyzing algorithms based on this widely used storage structure. Exact and asymptotic results are given for equally likely trees and those grown by binary insertion tree sorts applied to random strings of key symbols. An appendix is provided with tabulations of results.
Type
Technical Report
Description
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
NPS-55Bw7606l
Sponsors
supported by the Foundation Research Program with funds provided by the Chief of Naval Research, Arlington, Virginia, during FY 76
Funding
N0001476WR60052
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.