A compact encoding of unordered binary trees

Authors:
Kozue Iwata;Shiro Ishiwata;Shin-ichi Nakano
Affiliations:
Gunma University, Kiryu, Japan;Gunma University, Kiryu, Japan;Gunma University, Kiryu, Japan
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 5
Cited 0

Succinct Representation of Balanced Parentheses and Static Trees

SIAM Journal on Computing
Efficient generation of plane trees

Information Processing Letters
Succinct ordinal trees with level-ancestor queries

ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Handbook of Discrete and Combinatorial Mathematics, Second Edition

Handbook of Discrete and Combinatorial Mathematics, Second Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

A naive encoding of ordered binary trees with n vertices needs 2n bits for each tree, and it is asymptotically optimal. In this paper we give a new simple encoding of unordered binary trees. The encoding needs at most 4 + 1.4n bits for each tree. Our encoding and decoding algorithms are simple and run in O(n) time.