数据结构与算法练习---将数组中的数据生成霍夫曼树代码

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};
        Node huffmanTree = createHuffmanTree(arr);
        preOrder(huffmanTree);

    }

    public static Node createHuffmanTree(int[] arr){
        //为方便排序，将数组转为node节点，并存入list集合中
        List<Node> nodeList = new ArrayList<>();
        for (int i = 0; i < arr.length; i++) {
            nodeList.add(new Node(arr[i]));
        }
        //循环构建树结构
        while (nodeList.size() > 1){
            //排序
            Collections.sort(nodeList);
            //选取最小的两个元素（前两位）
            Node leftNode = nodeList.get(0);
            Node rightNode = nodeList.get(1);
            //构建父节点
            Node parent = new Node(leftNode.getValue() + rightNode.getValue());
            //构造二叉树
            parent.setLeft(leftNode);
            parent.setRight(rightNode);
            //删除原节点
            nodeList.remove(leftNode);
            nodeList.remove(rightNode);
            //将新节点加入数组
            nodeList.add(parent);
        }
        return nodeList.get(0);
    }

    //前序遍历
    public static void preOrder(Node node){
        if(node != null){
            node.preOrder();
        }else{
            System.out.println("根节点为空！");
        }
    }

}


class Node implements Comparable<Node>{
    private int value;
    private Node left;
    private Node right;

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

    public int getValue() {
        return value;
    }

    public void setValue(int value) {
        this.value = value;
    }

    public Node getLeft() {
        return left;
    }

    public void setLeft(Node left) {
        this.left = left;
    }

    public Node getRight() {
        return right;
    }

    public void setRight(Node right) {
        this.right = right;
    }

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

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

    //前序遍历
    public void preOrder(){
        System.out.println(this);
        if(this.left != null){
            this.left.preOrder();
        }
        if(this.right != null){
            this.right.preOrder();
        }
    }
}