Introduction - If you have any usage issues, please Google them yourself
Use the following scheme is binary coded: empty tree coded 0 for single-node tree coding for an all m-node binary coding is less than (m+1) nodes of the binary tree binary number, if any m-node, when about son tree for the L and R when the binary number is a n, then the following cases all m binary tree nodes, which number is greater than n: left subtree of the left subtree number greater than the number of L is L, the number of right subtree R requires more than a given sequence number, a binary output