二叉排序树的删除（终极版）

之所以没有直接删除，是因为万一有两个子树，无法直接接到其父节点。

应该先看被删的结点

if(是否有前驱，若有前驱)

{

把被删的结点设为前驱的值，并移除前驱；

}
else if( 看被删的结点是否有后继，若有后继     ){

把被删的结点设为后继的值，并移除后继；

}

else{

直接移除此点；//既无前驱，又无后继

}

#include<iostream>
using namespace std;
class Node {
public:
    int data;
    Node *lchild, *rchild, *father;
    Node(int _data, Node *_father = NULL) {
        data = _data;
        lchild = NULL;
        rchild = NULL;
        father = _father;
    }
    ~Node() {
        if (lchild != NULL) {
            delete lchild;
        }
        if (rchild != NULL) {
            delete rchild;
        }
    }
    void insert(int value) {
        if (value == data) {
            return;
        } else if (value > data) {
            if (rchild == NULL) {
                rchild = new Node(value, this);
            } else {
                rchild->insert(value);
            }
        } else {
            if (lchild == NULL) {
                lchild = new Node(value, this);
            } else {
                lchild->insert(value);
            }
        }
    }
    Node* search(int value) {
        if (data == value) {
            return this;
        } else if (value > data) {
            if (rchild == NULL) {
                return NULL;
            } else {
                return rchild->search(value);
            }
        } else {
            if (lchild == NULL) {
                return NULL;
            } else {
                return lchild->search(value);
            }
        }
    }
    Node* predecessor() {
        Node *temp = lchild;
        while (temp != NULL && temp->rchild != NULL) {
            temp = temp->rchild;
        }
        return temp;
    }
    Node* successor() {
        Node *temp = rchild;
        while (temp != NULL && temp->lchild != NULL) {
            temp = temp->lchild;
        }
        return temp;
    }
    void remove_node(Node *delete_node) {
        Node *temp = NULL;
        if (delete_node->lchild != NULL) {
            temp = delete_node->lchild;
            temp->father = delete_node->father;
            delete_node->lchild = NULL;
        }
        if (delete_node->rchild != NULL) {
            temp = delete_node->rchild;
            temp->father = delete_node->father;
            delete_node->rchild = NULL;
        }
        if (delete_node->father->lchild == delete_node) {
            delete_node->father->lchild = temp;
        } else {
            delete_node->father->rchild = temp;
        }
        delete delete_node;
    }
    bool delete_tree(int value)
    {
      Node *delete_node,*current_node;
      current_node=search(value);
      if(current_node==NULL)
      { 
          return false;
      }
      if(current_node->lchild!=NULL)
      {
          delete_node=current_node->predecessor();
      }
      else if(current_node->rchild!=NULL)
      {
          delete_node=current_node->successor();
      }
        else
        {
            delete_node=current_node;
        }
        current_node->data=delete_node->data;    
        remove_node(delete_node);
        return true;
    }
    
};
class BinaryTree {
private:
    Node *root;
public:
    BinaryTree() {
        root = NULL;
    }
    ~BinaryTree() {
        if (root != NULL) {
            delete root;
        }
    }
    void insert(int value) {
        if (root == NULL) {
            root = new Node(value);
        } else {
            root->insert(value);
        }
    }
    bool find(int value) {
        if (root->search(value) == NULL) {
            return false;
        } else {
           return true;
        }
    }
    bool delete_tree(int value)
    {
       return   root->delete_tree(value);
    }
};
int main() {
    BinaryTree binarytree;
    int arr[10] = { 8, 9, 10, 3, 2, 1, 6, 4, 7, 5 };
    for (int i = 0; i < 10; i++) {
        binarytree.insert(arr[i]);
    }
    int value;
    cin >> value;
    if (binarytree.find(value)) {
        cout << "search success!" << endl;
    } else {
        cout << "search failed!" << endl;
    }
    cin>>value;
   if( binarytree.delete_tree(value))
   {
        cout<<"delete success!"<<endl;   
   }
    else
    {
        cout<<"delete failed!"<<endl;   
    }
    return 0;
}