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.