An Investigation and Implementation of Some Binary Search Tree Algorithms

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/7352

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Wood, D.	en_US
dc.contributor.author	Walker, Aldon N.	en_US
dc.date.accessioned	2014-06-18T16:39:03Z	-
dc.date.available	2014-06-18T16:39:03Z	-
dc.date.created	2010-07-12	en_US
dc.date.issued	1974-11	en_US
dc.identifier.other	opendissertations/2633	en_US
dc.identifier.other	3567	en_US
dc.identifier.other	1391107	en_US
dc.identifier.uri	http://hdl.handle.net/11375/7352	-
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>	en_US
dc.subject	Computer Engineering	en_US
dc.subject	Computer Engineering	en_US
dc.title	An Investigation and Implementation of Some Binary Search Tree Algorithms	en_US
dc.type	thesis	en_US
dc.contributor.department	Computation	en_US
dc.description.degree	Master of Science (MS)	en_US
Appears in Collections:	Open Access Dissertations and Theses

Files in This Item:

File	Size	Format
fulltext.pdf Open Access	9.22 MB	Adobe PDF	View/Open