What is the time complexity of Huffman Coding?
(A)
O(N)
(B)
O(NlogN)
(C)
O(N(logN)^2)
(D)
O(N^2)
Answer: (B)
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 calls minHeapify(). So, overall complexity is O(nlogn).
Quiz of this Question
Please comment below if you find anything wrong in the above post