Question

Huffman Coding uses a greedy approach to achieve what?

A Shortest path in a graph.
B Optimal prefix codes for data compression.
C Maximum flow in a network.
D Solving the 0/1 Knapsack problem.
E Finding all pairs shortest paths.
Practice Next

Hey! Ask a query