Back to search

McMaster University

An Investigation and Implementation of Some Binary Search Tree Algorithms

Abstract

dc:description.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>

Degree

thesis:*
Department dc:contributor.department
Computation
Year dc:date.issued
1974

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Walker, Aldon N.
Advisor dc:contributor.advisor
  • Wood, D.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/2633
3567
1391107

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Walker, Aldon N.. An Investigation and Implementation of Some Binary Search Tree Algorithms. 1974. http://hdl.handle.net/11375/7352