哈夫曼树

class HuffmanTree

package DataStructures.tree;

import java.util.ArrayList;
import java.util.Collections;

/**
 * 赫夫曼树
 * @author coffee
 * @Date 2021-04-04 15:05
 */
public class HuffmanTree {
    public static void main(String[] args) {
        int[] arr = {13,7,8,3,29,6,1};
        System.out.println(huffmanTree(arr));
    }

    /**
     *创建赫夫曼数
     */
    public static Node huffmanTree(int[] arr){
        ArrayList<Node> nodes = new ArrayList<>();
        for (int v : arr){
            nodes.add(new Node(v));
        }
        while (nodes.size() > 1){
            Collections.sort(nodes);
            Node leftNode = nodes.get(0);
            Node rightNode = nodes.get(1);

            Node parent = new Node(leftNode.value + rightNode.value);
            parent.left = leftNode;
            parent.right = rightNode;

            nodes.remove(leftNode);
            nodes.remove(rightNode);
            nodes.add(parent);
        }
        return nodes.get(0);
    }
}
//节点类
class Node implements Comparable<Node>{
    int value;
    Node left;
    Node right;

    public Node(int value) {
        this.value = value;
    }

    @Override
    public String toString() {
        return "Node{" +
                "value=" + value +
                '}';
    }

    @Override
    public int compareTo(Node o) {
        return this.value - o.value;
    }
}