<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)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/7352 |
| Date | 11 1900 |
| Creators | Walker, Aldon N. |
| Contributors | Wood, D., Computation |
| Source Sets | McMaster University |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0029 seconds