Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/7352| Title: | An Investigation and Implementation of Some Binary Search Tree Algorithms |
| Authors: | Walker, Aldon N. |
| Advisor: | Wood, D. |
| Department: | Computation |
| Keywords: | Computer Engineering;Computer Engineering |
| Publication Date: | Nov-1974 |
| Abstract: | <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> |
| URI: | http://hdl.handle.net/11375/7352 |
| Identifier: | opendissertations/2633 3567 1391107 |
| Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| fulltext.pdf | 9.22 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.
