树的前中后序遍历+树的高度和节点数

树的前序遍历+中序遍历+后序遍历

基于对数组和链表的存储优缺点分析，这里按照需求引进了一种新的数据结构，树
它可以在增删改查上都保持高效率

创建如下图所示的二叉树，并分别使用三种顺序遍历：

代码实现：

package Tree;

public class BinaryTreeDemo {
    public static void main(String[] args) {
        //测试
        BinaryTree bt = new BinaryTree();
        //新建英雄节点
        HeroNode root = new HeroNode(1,"宋江");
        HeroNode h2 = new HeroNode(2,"吴用");
        HeroNode h3 = new HeroNode(3,"卢俊义");
        HeroNode h4 = new HeroNode(4,"林冲");
        //手动创建二叉树，后面会使用递归构建的方法
        root.setLeft(h2);
        root.setRight(h3);
        h3.setRight(h4);
        bt.setRoot(root);

        //测试
        bt.defixOrder();
    }
}

//创建二叉树
class BinaryTree{
    //根节点
    HeroNode root;

    public void setRoot(HeroNode root) {
        this.root = root;
    }
    public void preOrder(){
        if(this.root != null){
            this.root.preOrder();
        }else{
            System.out.println("当前二叉树为空");
        }
    }
    public void infixOrder(){
        if(this.root != null){
            this.root.infixOrder();
        }else{
            System.out.println("当前二叉树为空");
        }
    }
    public void defixOrder(){
        if(this.root != null){
            this.root.defixOrder();
        }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 infixOrder() {
        if (this.left != null) {
            this.left.infixOrder();
        }
        System.out.println(this);
        if (this.right != null) {
            this.right.infixOrder();
        }
    }
    //后序遍历
    public void defixOrder(){
        if(this.left != null){
            this.left.defixOrder();
        }
        if(this.right != null){
            this.right.defixOrder();
        }
        System.out.println(this);
    }

}

二.树的高度和节点数

1.求二叉树的高度

如果左比右小,右+1;

如果左比右大,左+1;

public int getHeight(TreeNode node){
	if(node == null){
		return 0;
	}
	int i = getHeight(node.left);
	int j = getHeight(node.right);
	return (i<j)? j+1:i+1;
}

2.求二叉树的节点数

1+左节点+右节点

public int getSize(TreeNode node){
	if(node == null){
	return 0;
	}
	return 1+getSize(node.left)+getSize(node.right);
}