java实现二叉排序树

package src.com.zhang.tree.binarysorttree;

import src.com.zhang.project03Employee.service.NameListService;

public class BinarySortTree {
    public static void main(String[] args) {
        int[] arr={7,3,10,12,5,1,9,2};
        BinarySortTreeCreate binarySortTreeCreate = new BinarySortTreeCreate();
        for (int i = 0; i < arr.length; i++) {
            binarySortTreeCreate.add(new Node(arr[i]));
        }
        System.out.println("中序遍历二叉排序树：");
        binarySortTreeCreate.indexOrder();

//        binarySortTreeCreate.delNode(2);
//        System.out.println("删除叶子节点2后:");
//        binarySortTreeCreate.indexOrder();

//        System.out.println("删除叶子节点2后:");
//        binarySortTreeCreate.delNode(2);
//        binarySortTreeCreate.indexOrder();
//
//        System.out.println("删除叶子节点5后:");
//        binarySortTreeCreate.delNode(5);
//        binarySortTreeCreate.indexOrder();

        System.out.println("删除叶子节点1后:");
        binarySortTreeCreate.delNode(1);
        binarySortTreeCreate.indexOrder();

        System.out.println("删除叶子节点10后:");
        binarySortTreeCreate.delNode(10);
        binarySortTreeCreate.indexOrder();



    }
}

//创建二叉排序树
class BinarySortTreeCreate{
    private Node root;

    public Node search(int value){
        if (root==null){
            return null;
        }else{
            return root.search(value);
        }
    }

    public Node searchParent(int value){
        if (root!=null){
            return null;
        }else{
            return root.serchParent(value);
        }
    }

    //删除节点
    public void delNode(int value){
        if (root==null){
            System.out.println("root为空");
            return;
        }
        else {
            //先找到需要删除的节点
            Node targetNode=this.search(value);
            //如果没有找到，则停止
            if (targetNode==null){
                System.out.println("11111111");
                return;
            }
            //如果targetNode没有父节点
            if (root.left==null&&root.right==null){
                root=null;
                return;
            }
            System.out.println("22222");
            Node parent=root.serchParent(value);
            //如果要删除的是叶子节点
            if (targetNode.left==null && targetNode.right==null){
                //判断targetNode是parent的左子节点还是又子节点
                if (parent.left!=null&&parent.left.value==value){
                    System.out.println("33333333");
                    parent.left=null;
                } else if (parent.right!=null && parent.right.value==value) {
                    System.out.println("4444444");
                    parent.right=null;
                }
            }
            else if (targetNode.left!=null && targetNode.right!=null) //删除有两颗子树的节点
            {
                int min = delRightTreeMin(targetNode.right);
                targetNode.value=min;

            }
            else//删除只有一颗子树的节点
            {
                //如果要删除的节点有左子节点
                if (targetNode.left!=null){
                    if (parent!=null) {

                        if (parent.left.value == value) {
                            parent.left = targetNode.left;
                        } else {
                            parent.right = targetNode.left;
                        }
                    }
                    else {
                        root=targetNode.left;
                    }
                }
                else //如果要删除的节点有右子节点
                {
                    if (parent!=null) {
                        if (parent.left.value == value) {
                            parent.left = targetNode.right;
                        } else {
                            parent.right = targetNode.right;
                        }
                    }
                    else {
                        root=targetNode.right;
                    }
                }
            }
        }
    }

    public void add(Node node){
        if (root==null){
            root=node;
        }
        else {
            root.add(node);
        }
    }

    public void indexOrder(){
        if (root==null){
            System.out.println("空树不能遍历");
        }else {
            root.indexOrder();
        }
    }
    public int delRightTreeMin(Node node){
        Node target=node;
        while (target.left!=null){
            target=target.left;
        }
        delNode(target.value);
        return target.value;
    }
}

class Node{
    int value;
    Node left;
    Node right;

    //查找要删除的节点
    public Node search(int value){
        if (value==this.value){
            System.out.println("xxxxxxxxx");
            return this;
        }
        else if(this.value>value){
            if (this.left==null){
                System.out.println("xxxxxxxxx1");
                return null;
            }
            System.out.println("wwwwwww1");
            return this.left.search(value);
        }else {
            if (this.right==null){
                System.out.println("xxxxxxxxx2");
                return null;
            }
            System.out.println("wwwwwwwwww2");
            return this.right.search(value);
        }
    }

    /**
     *
     * @param value 要删除的节点的值
     * @return
     */
    //查找要删除节点的父节点
    public Node serchParent(int value){
        if ((this.left!=null&&this.left.value==value) || (this.right!=null&&this.right.value==value)){
                return this;
        }else {
            if (value<this.value&&this.left!=null){
               return this.left.serchParent(value);
            }else if (value>=this.value&&this.right!=null){
                return this.right.serchParent(value);
            }else {
                return null;
            }
        }
    }


    public Node(int value){
        this.value=value;
    }
//构建二叉排序树
    public void add(Node node){
        if (node==null){
            return;
        }
       if (node.value<this.value){
           if (this.left==null){
               this.left=node;
           }
           else {
               this.left.add(node);
           }
       }
       else {
           if (this.right==null){
               this.right=node;
           }else {
               this.right.add(node);
           }
       }
    }
    //中序遍历
    public void indexOrder(){
        if (this.left!=null){
            this.left.indexOrder();
        }
        System.out.println(this.value);
        if (this.right!=null){
            this.right.indexOrder();
        }
    }
}