private void TraverseTree(HuffmanTreeNode node, int length, int value)
{
if (node.Left != null)
{
length++;
TraverseTree(node.Left, length, value);
value |= (1 << (length - 1));
TraverseTree(node.Right, length, value);
}
else
CompressedBytes[node.ByteCount.Byte] = new CompressedByte { Length = length, Value = value };
}