Building Huffman tree adding one letter at a time versus building it from two ends

I entered ‘abcde’ in this Huffman encoding generator and hit play and saw it build 2 separate trees first for the shortest and then for the longest encoding. How would it be if one added one character at a time? When do you begin with building from both ends?