- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Greedy Algorithms | Question 3
Last Updated :
Discuss
Comments
What is the time complexity of Huffman Coding?
O(N)
O(NlogN)
O(N(logN)^2)
O(N^2)
This question is part of this quiz :
Top MCQs on Greedy Algorithms with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy