Q476
What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
A.
O(C)
B.
O(log C)
C.
O(C log C)
D.
O(C2)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board