Skip Navigation

The Computer Journal 2002 45(2):237-242; doi:10.1093/comjnl/45.2.237
© 2002 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 Balakirsky, V. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A New Coding Algorithm for Trees

Vladimir B. Balakirsky1

1 Euler Institute for Discrete Mathematics and its Applications (EIDMA), Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands Email: v.b.balakirsky@tue.nl

We construct a one-to-one mapping between binary vectors of length $n$ and preorder codewords of regular, ordered, oriented, rooted, binary trees having $N \approx n + 2$ log $n$ nodes. The mappings in both directions can be organized in such a way that complexities of all transformations are measured by linear functions of $n$. The approach is then completely extended to non-regular binary trees and partially extended to $D$-ary trees with $D > 2$.


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.