Algorithms | Greedy Algorithms | Question 3
What is the time complexity of Huffman Coding?
Explanation: O(nlogn) where n is the number of unique characters. If there are n nodes, extractMin() is called 2*(n – 1) times. extractMin() takes O(logn) time as it calles minHeapify(). So, overall complexity is O(nlogn).
See here for more details of the algorithm.
Quiz of this Question