Which of the following does not use Greedy approach?
Huffman Coding
0/1 Knapsack
Fractional Knapsack
Minimum Spanning Tree
This question is part of this quiz :