How would a Huffman tree look different if we used different tie-breakers. and how would that impact the potential compression?

The huffman coding reduces the number of bits which are needed in the storage or sending of a message. The principle is using a lower bit number in encoding data that occurs more frequently.

When we use a different tree, the coding will be different. A huffman tree structure changes in terms of the code written when what is used is a different tie breaker. The tree's structure is determined as regards the coding of any leaf using 0/1 edge convention. This would help in more optimal storage.

nope i prefer two because it is simpler, i don't like all the powers you get

explanation:

but that's my opinion

we need a link or picture : )