Please check my Huffman tree My professor gave an example of Huffman tree.

Given inputs

a 80
b 10
c 20
d 50
e 100
f 35
g 60


… then the tree will be:



But when i tried to solve it at home, I get this answer:



Which is correct, and why?
The average codeword length of your professor's code is $2.577$.

The average codeword length of your code is $2.662$.

Huffman's algorithm produces a code minimizing the average codeword length.

You draw the conclusions.