LeetCode 450. Delete Node in a BST

最新推荐文章于 2023-02-23 16:48:15 发布

junchen1992

最新推荐文章于 2023-02-23 16:48:15 发布

阅读量617

点赞数

分类专栏：算法 LeetCode

本文链接：https://blog.csdn.net/junchen1992/article/details/53141939

版权

算法同时被 2 个专栏收录

141 篇文章 0 订阅

订阅专栏

LeetCode

129 篇文章 0 订阅

订阅专栏

Problem Statement

(Source) 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 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

Tags: Tree.

Solution

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def deleteNode(self, root, key):
        """
        :type root: TreeNode
        :type key: int
        :rtype: TreeNode
        """
        # Find the node x with val = key to delete
        x, parent = root, None
        while x and x.val != key:
            parent = x
            if key < x.val:
                x = x.left
            else:
                x = x.right
        # If cannot find the target node x
        if not x:
            return root
        # Delete x
        if (not x.left) and (not x.right):
            if parent:
                if x == parent.left:
                    parent.left = None
                else:
                    parent.right = None
            else:
                return None
        elif x.left and x.right:
            xx = x
            parent = x
            x = x.left
            while x.right:
                parent = x
                x = x.right
            xx.val = x.val
            if x == parent.left:
                parent.left = x.left
            else:
                parent.right = x.left
        else:
            if not parent:
                return x.left or x.right
            elif x.left:
                if x == parent.left:
                    parent.left = x.left
                else:
                    parent.right = x.left
            else:
                if x == parent.left:
                    parent.left = x.right
                else:
                    parent.right = x.right
        return root