Introduction - If you have any usage issues, please Google them yourself
According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann