【leetcode】【medium】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

题目链接：https://leetcode-cn.com/problems/delete-node-in-a-bst/

 

思路

BST的删除操作：先查找到节点n，找后继节点取代被删节点位置。后继节点就是被删节点右子树上的最小值，问题就转为删除右子树的min，被删的min取代n。

本题的递归函数和以往有所不同：下层做逻辑判断，返回节点指针，上层将下层给的指针连在自己身上。

/**
 * 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 {
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        if(!root) return root;
        if(root->val == key){
            if(!root->left){
                auto node = root;
                root = root->right;
                delete node;
                return root;
            }
            if(!root->right){
                auto node = root;
                root = root->left;
                delete node;
                return root;
            }
            TreeNode* tmp = new TreeNode(getNode(root->right)->val);
            tmp->left = root->left;
            tmp->right = delNode(root->right);
            delete root;
            return tmp;
        }else if(root->val > key){
            root->left = deleteNode(root->left, key);
            return root;
        }else{
            root->right = deleteNode(root->right, key);
            return root;
        }
    }
    TreeNode* getNode(TreeNode* root){
        if(!root->left) return root;
        return getNode(root->left);
    }
    TreeNode* delNode(TreeNode* root){
        if(!root->left){
            auto tmp = root->right;
            delete root;
            return tmp;
        }
        root->left = delNode(root->left);
        return root;
    }
};