数据结构与算法-树-赫夫曼树

package tree;

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


public class HuffmanTree {

    public static void main(String[] args) {
        int[] arr = {13, 7, 8, 3, 29, 6, 1};
        List list = new ArrayList<>();
        for (int i : arr) {
            list.add(new Node(i));
        }
        Node node = createHuffmanTree(list);
        node.preOrder();
    }

    
    public static class Node implements Comparable {
        public Node left;
        public Node right;
        public int val;

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

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

        
        public void preOrder() {
            System.out.println(this);
            if (this.left != null) {
                this.left.preOrder();
            }
            if (this.right != null) {
                this.right.preOrder();
            }
        }

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

    
    public static Node createHuffmanTree(List list) {
        //当list只有一个元素代表赫夫曼树已经创建好了
        //每次将节点排好序，取前两个构成新的节点，移除原来的前两个节点，
        //将新的节点添加进list。最终只剩下一颗赫夫曼树
        while (list.size() > 1) {
            Collections.sort(list);
            Node leftNode = list.get(0);
            Node rightNode = list.get(1);
            Node parent = new Node(leftNode.val + rightNode.val);
            parent.left = leftNode;
            parent.right = rightNode;
            list.remove(leftNode);
            list.remove(rightNode);
            list.add(parent);
        }
        return list.get(0);
    }
}