In this paper, a new method based on a binary-tree representation is introduced in order ... This assumption leads to a very optimized representation in term of time and memory. The other advantages ...

You are given a binary tree ... Here are a few examples: A root node with no children: (00) A root node with two children: ((00)(00)) An unbalanced tree with three consecutive left children: ...