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

代码

package day210629.tree;

public class BinaryTreeDemo {
    //3.再写测试类
    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.setLeft(node4);

        //把root节点给binaryTree
        binaryTree.setRoot(root);
        //前序遍历
        binaryTree.preOrder();
        System.out.println("==================");
        //中序遍历
        binaryTree.infixOrder();
        System.out.println("==================");

        //后序遍历
        binaryTree.postOrder();
    }

}

//2.再创建树
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 infixOrder() {
        if (this.root != null) {
            this.root.infixOrder();
        }
    }

    public void postOrder() {
        if (this.root != null) {
            this.root.postOrder();
        }
    }
}

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

    public HeroNode(int no, String name) {
        super();
        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 postOrder() {
        if (this.left != null) {
            this.left.postOrder();
        }
        if (this.right != null) {
            this.right.postOrder();
        }
        System.out.println(this);
    }
}

结果

HeroNode{no=1, name='盖伦'}
HeroNode{no=2, name='赵信'}
HeroNode{no=3, name='锤石'}
HeroNode{no=4, name='亚索'}
==================
HeroNode{no=2, name='赵信'}
HeroNode{no=1, name='盖伦'}
HeroNode{no=4, name='亚索'}
HeroNode{no=3, name='锤石'}
==================
HeroNode{no=2, name='赵信'}
HeroNode{no=4, name='亚索'}
HeroNode{no=3, name='锤石'}
HeroNode{no=1, name='盖伦'}