These trees are built as canonical huffman trees. Remember that negative values are 2's complement encoded and thus appear after the positive values in the trees.

• 0: 1 bit
• 1: 2 bits
• 2: 3 bits
• 3: 4 bits
• 4: 5 bits
• 5: 6 bits
• 6: 7 bits
• 7: 7 bits

• -4: 7 bits
• -3: 7 bits
• -2: 5 bits
• -1: 3 bits
• 0: 1 bit
• +1: 2 bits
• +2: 4 bits
• +3: 6 bits