Skip Navigation

The Computer Journal 1991 34(5):438-443; doi:10.1093/comjnl/34.5.438
© 1991 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 (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mäkinen, E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Survey on Binary Tree Codings

E. Mäkinen *

University of Tampere, Department of Computer Science, P.O. Box 607, SF-33101 Tampere, Finland

Several combinatorial and other programs deal with the structure (or the shape) of binary trees paying no attention to the data possibly maintained by the tree. For such programs it is useful to represent the structure without pointers and records. This paper surveys such representations. Especially, we concentrate on different ways of representing the structure of a binary tree by using a sequence of integers.

Received November 1987. revised January 1991.

* University of Tampere, Department of Computer Science, P.O. Box 607, SF-33101 Tampere, Finland


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.