On Random Binary Trees
Technical rept. Jun 1975-Jun 1976
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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.
- Theoretical Mathematics
- Computer Hardware
- Computer Systems Management and Standards