Skip Navigation

The Computer Journal 1978 21(1):66-72; doi:10.1093/comjnl/21.1.66
© 1978 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Szwarcfiter, J. L.
Right arrow Articles by Wilson, L. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Some properties of ternary trees

J. L. Szwarcfiter * and L. B. Wilson

University of Newcastle upon Tyne, Computing Laboratory, Claremont Tower, Claremont Road, Newcastle upon Tyne, UK

Ternary search trees and ternary sequence search trees are defined as natural extensions of the binary case. Ternary tree insertion and its relation to topological sorting is also considered as a natural generalisation of binary tree insertion with its relationship to complete sorting. The problem of quasi-topological sorting, which can be regarded as a generalisation of topological sorting, is also solved using ternary trees. A possible definition of topological searching is presented. The analysis of ternary trees is given using recurrence relations.

Received December 1975.

* Universidade Federal do Rio de Janeiro, Brazil.

§ University of Newcastle upon Tyne, Computing Laboratory, Claremont Tower, Claremont Road, Newcastle upon Tyne NE1 7RU


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.