450. Delete Node in a BST

450. Delete Node in a BST

Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.

Basically, the deletion can be divided into two stages:

1. Search for a node to remove.
2. If the node is found, delete the node.

Note: Time complexity should be O(height of tree).

Example:

root = [5,3,6,2,4,null,7]
key = 3

    5
   / \
  3   6
 / \   \
2   4   7

Given key to delete is 3. So we find the node with value 3 and delete it.

One valid answer is [5,4,6,2,null,null,7], shown in the following BST.

    5
   / \
  4   6
 /     \
2       7

Another valid answer is [5,2,6,null,4,null,7].

    5
   / \
  2   6
   \   \
    4   7

思路：这里没有指针指向父节点，怎么办呢？首先，我们要记录要删除节点的父节点，同时用一个标志flag表明要删除的是父节点的左孩子还是右孩子。然后，把要删除的节点作为一个树的树根，删除其根节点后的树，再作为原父节点的左孩子或右孩子嫁接回去。返回，根节点。这里，对一颗树删除其根节点的方式采用例子中第一个答案的方式，首先找到它右孩子树的最小的节点作为新的根节点，找到这个右孩子数的最小节点，注意删除，即将其父节点的左孩子设为该节点的右孩子树。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    TreeNode* fun(TreeNode* root)//将一颗树的树根删除
    {
          if(!root->right) return root->left;
           else if(!root->left) return root->right;
           else {
               TreeNode* r=root->right,*p=NULL;
               while(r->left)//找到后继
               {
                   p=r;
                   r=r->left;
               }
               root->val=r->val;//设置新的根节点值
               if(p==NULL)//针对右孩子没有后继的情况
                root->right=r->right;
                else p->left=r->right;//将后继的右孩子嫁接到其父节点上
               return root;
           }
    }
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
       if(!root) return NULL;
       TreeNode* p=NULL,*node=root;int flag=0;//0表示左，1表示右
       while(node&&node->val!=key)
       {
           p=node;
           if(node->val>key)
           {node=node->left;flag=0;}
           else {node=node->right;flag=1;}
       }
       if(node==NULL) return root;//没有key节点
       TreeNode* child=fun(node);//删除key节点
       //将新的孩子嫁接到原来的树枝上
       if(p==NULL) return child;
        if(flag==0)
       {
           p->left=child;
       }else
       p->right=child;
       return root;
    }
};