【数据结构：树】二叉树---前、中、后序查找

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,"林冲");
        HeroNode node5 = new HeroNode(5,"关胜");

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

        System.out.println("前序遍历查找");
        HeroNode resNode = binaryTree.preOrderSearch(5);
        if(resNode!=null){
            System.out.printf("找到了，信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
        }else{
            System.out.printf("没有找到no=%d的英雄",resNode.getNo());
        }

        System.out.println("中序遍历查找");
        resNode = binaryTree.infixOrdersearch(5);
        if(resNode!=null){
            System.out.printf("找到了，信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
        }else{
            System.out.printf("没有找到no=%d的英雄",resNode.getNo());
        }

        System.out.println("后序遍历查找");
         resNode = binaryTree.postOrdersearch(5);
        if(resNode!=null){
            System.out.printf("找到了，信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
        }else{
            System.out.printf("没有找到no=%d的英雄",resNode.getNo());
        }
    }
}

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

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

    //前序遍历查找
    public HeroNode preOrderSearch(int no){
        if(root!=null){
            return root.preOrdersearch(no);
        }else{
            return null;
        }
    }

    //中序遍历查找
    public HeroNode infixOrdersearch(int no){
        if(root!=null){
            return root.infixOrdersearch(no);
        }else{
            return null;
        }
    }

    //后序遍历查找
    public HeroNode postOrdersearch(int no){
        if(root!=null){
            return root.postOrdersearch(no);
        }else{
            return null;
        }
    }
}
//创建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 HeroNode preOrdersearch(int no){
        //比较当前节点是不是
        if(this.no == no){
            return this;
        }

        //判断当前节点的左子节点是否为空，如果不为空，递归前序查找
        HeroNode resNode = null;
        if(this.left!=null){
           resNode = this.left.preOrdersearch(no);
        }
        if(resNode !=null){//说明左子树找到了
            return resNode;
        }

        if(this.right!=null){
            resNode = this.right.preOrdersearch(no);
        }
        return resNode;
    }

    /**
     * 中序遍历查找
     */
    public HeroNode infixOrdersearch(int no){
        //先判断当前节点的左子节点是否为空
        HeroNode resNode = null;
        if(this.left!=null){
             resNode = this.left.infixOrdersearch(no);
        }

        if(resNode!=null){
            return resNode;
        }
        if(this.no == no){
            return this;
        }

        if(this.right!=null){
            resNode = this.right.infixOrdersearch(no);
        }
        return resNode;
    }

    /**
     * 后续遍历查找
     */
    public HeroNode postOrdersearch(int no){

        HeroNode resNode = null;
        if(this.left!=null){
           resNode =  this.left.preOrdersearch(no);
        }
        if(resNode!=null){
            return resNode;
        }

        if(this.right!=null){
           resNode = this.right.preOrdersearch(no);
        }
        if(resNode!=null){
            return resNode;
        }

        if(this.no == no){
            return this;
        }
        return resNode;
    }
}