二叉树的前序、中序、后序遍历

二叉树遍历的说明：

前序遍历：先输出父节点，再遍历左子树和右子树

中序遍历：先遍历左子树，再输出父节点，再遍历右子树

后序遍历：先遍历左子树，再遍历右子树，最后输出父节点

小结：看输出父节点的顺序，就确定是前序中序还是后序

代码实现:

//二叉树的遍历:前序、中序、后序
public class BinaryTreeDemo {

    public static void main(String[] args) {
        //先需要创建一个二叉树
        BinaryTree binaryTree = new BinaryTree();

        //创建需要的节点
        HeroNode root = new HeroNode(1, "宋江");
        HeroNode node2 = new HeroNode(2, "吴用");
        HeroNode node3 = new HeroNode(3, "卢俊义");
        HeroNode node4 = new HeroNode(4, "林冲");

        //说明：先手动的创建二叉树，后面我们用递归的方式创建
        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        binaryTree.setRoot(root);

        //在3号节点，增加一个左子节点，
//        HeroNode  node5 = new HeroNode(5, "关胜");
//        node3.setLeft(node5);

        //测试
        System.out.println("前序遍历：");
        binaryTree.preOrder();
        System.out.println("======================");
        System.out.println("中序遍历：");
        binaryTree.midOrder();
        System.out.println("======================");
        System.out.println("后序遍历：");
        binaryTree.aftOrder();
        System.out.println("======================");

    }

}

//定义二叉树
class BinaryTree{
    private 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 midOrder(){
        if(this.root != null){
            this.root.midOrder();
        }else{
            System.out.println("当前二叉树为空，无法遍历");
        }
    }
    //后序遍历
    public void aftOrder(){
        if(this.root != null){
            this.root.aftOrder();
        }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 midOrder(){  //中序
        if(this.left != null){
            this.left.midOrder();
        }
        System.out.println(this);  //再输出父节点
        if(this.right != null){
            this.right.midOrder();
        }
    }
    public void aftOrder(){     //后序
        if(this.left != null){
            this.left.aftOrder();
        }
        if(this.right != null){
            this.right.aftOrder();
        }
        System.out.println(this);  //最后输出父节点
    }

}

测试结果：