What is the time complexity of Huffman coding algorithm?

The time complexity of the Huffman coding algorithm is O(n log n), where n is the number of symbols in the input data.