Date of Award

11-1974

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computation

Supervisor

D. Wood

Abstract

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.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Share

COinS