数据结构与算法之二叉树删除

二叉树删除

二叉树-删除节点
要求
如果删除的节点是叶子节点，则删除该节点
如果删除的节点是非叶子节点，则删除该子树.
测试，删除掉 5号叶子节点 和 3号子树

思路分析

代码实现

public class Treedemo {
    public static void main(String[] args) {

        HeroNode root = new HeroNode(1, "宋江");
        HeroNode node2 = new HeroNode(2, "吴用");
        HeroNode node3= new HeroNode(3, "卢俊义");
        HeroNode node4 = new HeroNode(4, "林冲");
        BinaryTree binaryTree = new BinaryTree();
        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        System.out.println("前序遍历为：");
        //设置根节点
        binaryTree.setRoot(root);
        binaryTree.preOrder();
        //调用前序查找
//        HeroNode res1=binaryTree.preOrderSearch(3);
//        System.out.println(res1.getNo()+"  "+res1.getName());
        binaryTree.delNode(3);
        System.out.println("删除后");
        binaryTree.preOrder();


    }
}
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();
        }else {
            System.out.println("二叉树为空");
        }
    }
    //后续递归遍历
    public void postOrder(){
        if (this.root!=null){
            this.root.postOrder();
        }else {
            System.out.println("二叉树为空");
        }
    }
    //前序查找遍历
    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;
        }
    }
    //删除前指定节点
    public void delNode(int no){
        if (root!=null) {
            if (root.getNo() == no) {
                root = null;
                return;
            } else {
                root.delNode(no);
            }
        }
       else {
            System.out.println("数为空");
        }
    }


}
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 postOrder() {
        if (this.left!=null){
            this.left.postOrder();
        }
        if (this.right!=null){
            this.right.postOrder();
        }
        System.out.println(this);
    }
    //递归前序查找
    public HeroNode preOrderSearch(int no){
        if (this.no==no){
            return this;
        }
        HeroNode res=null;
        if (this.left!=null){
            res=this.left.preOrderSearch(no);
        }
        if (res!=null){
            return res;
        }
        if (this.right!=null){
            res=this.right.preOrderSearch(no);
        }
        return res;
    }
    //递归中序查找
    public HeroNode infixOrderSearch(int no){
        HeroNode res=null;
        if (this.left!=null){
            res=this.left.infixOrderSearch(no);
        }
        if (res!=null){
            return res;
        }
        if (this.no==no){
            return this;
        }
        if (this.right!=null){
            res=this.right.infixOrderSearch(no);
        }
        return res;
    }
    //递归后续查找
    public HeroNode postOrderSearch(int no){
        HeroNode res=null;
        if (this.left!=null){
            res=this.left.postOrderSearch(no);
        }
        if (res!=null){
            return res;
        }
        if (this.right!=null){
            res=this.right.postOrderSearch(no);
        }
        if (this.no==no){
            return this;
        }
        return res;
    }
    //删除指定节点
    public void delNode(int no){
        if (this.left!=null&&this.left.no==no){
            this.left=null;
            return;
        }
        if (this.right!=null&&this.right.no==no){
            this.right=null;
            return;
        }
        if (this.left!=null){
            this.left.delNode(no);
        }
        if (this.right!=null){
            this.right.delNode(no);
        }
    }
}