LC 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
class Solution {
public:
  TreeNode* deleteNode(TreeNode* root, int key) {
    if(!root) return root;
    TreeNode* ret;
    if(root->val == key) {
      TreeNode* rnode_lmost = getlm_or_rm_node(root->right, true);
      if(rnode_lmost) {
        rnode_lmost->left = root->left;
        ret = root->right;
      }else ret = root->left;
    }else {
      if(key < root->val) root->left = deleteNode(root->left, key);
      else root->right = deleteNode(root->right, key);
      ret = root;
    }
    return ret;
  }
  TreeNode* getlm_or_rm_node(TreeNode* root, bool left){
    if(!root) return root;
    if(left) {
      while(root->left) root = root->left;
    }else {
      while(root->right) root = root->right;
    }
    return root;
  }
};
class Solution {
public:
    TreeNode *deleteNode(TreeNode *root, int key) {
        TreeNode **cur = &root;

        while (*cur && (*cur)->val != key)
            cur = (key > (*cur)->val) ? &(*cur)->right : &(*cur)->left;

        if (*cur) {
            if (!(*cur)->right) *cur = (*cur)->left;
            else {
                TreeNode **successor = &(*cur)->right;
                while ((*successor)->left) successor = &(*successor)->left;
                swap((*cur)->val, (*successor)->val);
                *successor = (*successor)->right ? (*successor)->right : nullptr;
            }
        }
        return root;
    }

};

原文地址:https://www.cnblogs.com/ethanhong/p/10354389.html

时间: 2024-09-30 00:13:39

LC 450. Delete Node in a BST的相关文章

450. Delete Node in a BST 删除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: Search for a node to remove. If

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: Search for a node to remove. If the n

Leetcode: 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: Search for a node to remove. If the n

[Swift]LeetCode450. 删除二叉搜索树中的节点 | 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: Search for a node to remove. If the n

leetcode_237题——Delete Node in a Linked List(链表)

Delete Node in a Linked List Total Accepted: 6113 Total Submissions: 12798My Submissions Question Solution Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2

leetCode 237. Delete Node in a Linked List 链表

237. Delete Node in a Linked List Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked

leetcode:237 Delete Node in a Linked List-每日编程第四题

Delete Node in a Linked List Total Accepted: 47385 Total Submissions: 107608 Difficulty: Easy Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 ->

237. Delete Node in a Linked List(C++)

237. Delete Node in a Linked Lis t Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked

[LeetCode][JavaScript]Delete Node in a Linked List

Delete Node in a Linked List Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list