A new coding algorithm for trees

V.B. Balakirsky

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)


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$.
Original languageEnglish
Pages (from-to)237-242
Number of pages6
JournalThe Computer Journal
Issue number2
Publication statusPublished - 2002


Dive into the research topics of 'A new coding algorithm for trees'. Together they form a unique fingerprint.

Cite this