Given X $=7,$ what is the minimum value of

of Y required to ensure that the resulting tree conforms to Huffman's algorithm and forms a valid Huffman tree?

NOTE: In the right Node in the tree, i should give him a value, the value is equal to X$+$Y $,$And i have the value of X $,$ Only the valuue of Y not.

Then $,$should know the min value of Y $,$that's give me a huffman tree.

That say $,$we should Given the rigth node a $7+$Y value and check if it give a huffamn tree!

Also $,$ you should not add any nodes more, only what you have already.