import java.util.*; import java.util.stream.Collectors; public class HuffmanTree { TreeNode root = null; Map m; public void constructHuffmanTree(List characters, List freq) { PriorityQueue q = new PriorityQueue<>(); for (int i = 0; i < freq.size(); ++i) { q.add(new TreeNode(characters.get(i), freq.get(i))); } while (q.size() > 1) { TreeNode a = q.poll(); TreeNode b = q.poll(); q.add(new TreeNode(a, b)); } root = q.poll(); m = root.getMap(); } public String encode(String humanMessage) { return humanMessage.trim() .chars() .mapToObj(c -> m.get(String.valueOf((char)c))) .collect(Collectors.joining()); } public String decode(String encodedMessage) { String message = encodedMessage.trim(); String result = ""; Map dec_map = m.entrySet().stream().collect( Collectors.toMap(HashMap.Entry::getValue, HashMap.Entry::getKey)); int pos = 0; String current = ""; do { int size = 0; do { current = message.substring(pos, ++size + pos); } while (!dec_map.containsKey(current)); result += dec_map.get(current); pos += size; } while (pos < message.length()); return result; } }