二叉树和简单哈夫曼树

public class Recursion {
    public static void main(String[] args) {
        //先要创建一颗二叉树
        BinaryTree binaryTree = new BinaryTree();
        //创建需要的结点
        HeroNode root = new HeroNode(1,"Lucy");
        HeroNode node2 = new HeroNode(2,"Judy");
        HeroNode node3 = new HeroNode(3,"Scne");
        HeroNode node4 = new HeroNode(4,"Macky");

        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        binaryTree.setRoot(root);

        //测试
        System.out.println("前序遍历");
        binaryTree.perOrder();
        //测试
        System.out.println("中序遍历");
        binaryTree.inOrder();
        //测试
        System.out.println("后序遍历");
        binaryTree.pastOrder();

    }
}
//定义一个BinaryTree 二叉树
class BinaryTree{
    private HeroNode root;

    public void setRoot(HeroNode root){
        this.root = root;
    }

    //前序遍历
    public void perOrder(){
        if(this.root != null){
            this.root.preOrder();
        }
        else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //中序遍历
    public void inOrder(){
        if(this.root != null){
            this.root.inOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //后序遍历
    public void pastOrder(){
        if(this.root != null){
            this.root.postOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }
}

//先创建HeroNode 结点
class HeroNode{
    private int no;
    private String name;
    private HeroNode left;
    private HeroNode right;

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public HeroNode getLeft() {
        return left;
    }

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

    public HeroNode getRight() {
        return right;
    }

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

    @Override
    public String toString() {
        return "HeroNode [no=" + no+", name = "+name+"]";
    }
    //前序遍历
    public void preOrder(){
        System.out.println(this);
        if(this.left != null){
            this.left.preOrder();
        }
        if(this.right != null){
            this.right.preOrder();
        }
    }
    //中序遍历
    public void inOrder(){
        if(this.left != null){
            this.left.inOrder();
        }
        System.out.println(this);
        if(this.right != null){
            this.right.inOrder();
        }
    }
    //后序遍历
    public void postOrder(){
        if(this.left != null){
            this.left.postOrder();
        }
        if(this.right != null){
            this.right.postOrder();
        }
        System.out.println(this);
    }
}

哈夫曼（1）

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

public class Demo1 {
    public static void main(String[] args) {
        int arr[] = {13,7,8,3,29,6,1};
        Node node = creatHuffmanTree(arr);
        PreOrder(node);
    }
    //
    public static Node creatHuffmanTree(int[] arr) {
        /*
            第一步为了操作方便
            1.遍历arr 数组
            2. 将arr的每个元素构成成一个Node
            3.将Node放入到ArrayList 中
         */

        List<Node> nodes = new ArrayList<Node>();
        for (int value : arr) {
            nodes.add(new Node(value));
        }
        //
        while(nodes.size() > 1)
        {
            Collections.sort(nodes);

            Node partents = new Node(nodes.get(0).value + nodes.get(1).value);
            partents.left = nodes.get(0);
            partents.right = nodes.get(1);

            nodes.remove(0);
            nodes.remove(0);
            nodes.add(partents);
         }
        return nodes.get(0);
    }
    static void PreOrder( Node root){
        System.out.print(root.value+" ");
        if(root.left != null){
            PreOrder(root.left);
        }
        if(root.right!= null){
            PreOrder(root.right);
        }
    }
}
/*
    创建结点类
    为了让NOde 对象持续排序Collections集合排序
    故让NODE 实现Comparable接口
 */
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;
    }
}