Skip to main content
3 votes

Is it possible to encode the structure of a binary cardinal tree with n nodes using only n bits?

The discussion in the linked FGGSV paper is about binary trees with no unary nodes. It is easy to encode such trees with $n$ nodes by $n$-bit strings: write the tree in preorder, indicating for each ...
Emil Jeřábek's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible