On random binary trees
By: by Gerald G. Brown and Bruno Ol Shubert
Contributors: Shubert, Bruno Otto; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1976
Place of publication: Monterey, California
Language: eng
Number of pages: 46
Subjects: Combinatorial analysis; Binary system (Mathematics); Stochastic analysis
Description: 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.
Notes: Title from cover.

"NPS-55Bw76061"--Cover.

"June 1976"--Cover.

Technical report for period June 1975 - June 1976.

"Prepared for: Chief of Naval Research, Arlington, Virginia 22217."

Includes bibliographical references (p. 45)

"Approved for public release; distribution is unlimited"--Cover.

Technical report; June 1975 - June 1976.

ck/ 7/30/09.