Skip Navigation

The Computer Journal 1986 29(1):52-59; doi:10.1093/comjnl/29.1.52
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Suraweera, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching

F. Suraweera *

Mathematics Department, Kuwait University, P.O. Box 5969, Kuwait

The problem of minimising the search length (time) associated with a variable length, doubly chained tree structure with weighted terminal nodes and its implications on the organisation of a file are investigated. The main result is an algorithm which constructs an optimal doubly chained tree as a static data structure. Also considered are a few ramifications, particularly when the search steps have unequal costs. The supporting activity of file maintenance is also discussed. Two methods of updating a data file organised as a doubly chained tree structures are presented, which allow the realisation of a dynamic data structure.

Received April 1984.

* Mathematics Department, Kuwait University, P.O. Box 5969, Kuwait


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.