Probabilistic Method for Analyzing Search Trees
Abstract
This thesis presents a probabilistic method for analyzing search trees and applies this method to some constrained classes of limited branching search trees. It is hoped that this method of analysis may help in gaining insight into the expected behavior of search trees when they are utilized as storage structures in information storage and retrieval.
Collections
- OSU Theses [15752]