Even if the two introduced Huffman trees result in the same data volume, they differ in their individual code lengths. This is not of importance for the achievable data compression rate, but it could be of interest for dimensioning memory architectures, e.g. for interfaces with buffered data streams.

Code trees with a different variance:

< ^ >