Q9. Greedy9
What is the time complexity of Huffman Coding?
O(N)
O(NlogN)
O(N(logN)^2)
O(N^2)
here the answer given is 3rd option, but it should be the 2nd option
Problem in answer
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.