On Random Binary Trees

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA028454

Entities

People

  • Bruno O. Shubert
  • Gerald G. Jerry Brown

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Asymptotic Series
  • Classification
  • Complex Variables
  • Computer Science
  • Digital Computers
  • Integrals
  • Meromorphic Functions
  • Military Research
  • Operations Research
  • Permutations
  • Polynomials
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences
  • Trees (Data Structures)

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Human-Computer Interaction (HCI).
  • Systems Analysis and Design