450. 删除二叉搜索树中的节点

题目链接

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        // 没找到
        if (!root) return root;
        // 找到了
        if (root->val == key) {
            // 左边无，右边无
            if (!root->left && !root->right) return nullptr;
            // 左边有，右边无
            else if (root->left && !root->right) return root->left;
            // 左边无，右边有
            else if (!root->left && root->right) return root->right;
            // 左边有，右边有
            else {
                // 将左子树，接到右子树最左边
                TreeNode* cur = root->right;
                while (cur->left) {
                    cur = cur->left;
                }
                cur->left = root->left;
                TreeNode* temp = root;
                root = root->right;
                delete temp;
                return root;
            }
            
        }

        if (root->val > key ) root->left = deleteNode(root->left, key);
        if (root->val < key ) root->right =deleteNode(root->right, key);
        return root;
    }
};

总结

• 通过递归找到节点
• 通过判断节点的几种情况，进行删除
• 像平衡二叉树一样的删除。