Developing a program that compresses input data
Key Features:
- Implement Huffman tree using three priority queue data structures binary heap, 4-way cache optimized heap and pairing heaps.
- Evaluate performance of each algorithm used to implement three data structures in order to find out best fit to implement Huffman tree.
Language : Java Operating System: Linux Ubuntu