Return to search

An Investigation and Implementation of Some Binary Search Tree Algorithms

<p>This project documents the results of an investigation into binary search trees. Because of their favourable characteristics binary search trees have become popular for information storage and retrieval applications in a one level store. The trees may be of two types, weighted and unweighted. Various algorithms are presented, in a machine independent context, for both types and an empirical evaluation is performed. An important software aid used for graphically displaying a binary tree is also described.</p> / Master of Science (MS)

Identiferoai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/7352
Date11 1900
CreatorsWalker, Aldon N.
ContributorsWood, D., Computation
Source SetsMcMaster University
Detected LanguageEnglish
Typethesis

Page generated in 0.0015 seconds