| Q. |
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) |
| Answer» D. o(c2) | |
| Explanation: if the implementation of the priority queue is done using linked lists, the running time of huffman algorithm is o(c2). | |
Login to Continue
It will take less than 2 minutes