LeetCode 450. Delete Node in a BST

原创 2017年01月04日 08:36:18

原题网址:https://leetcode.com/problems/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

方法:根据情况进行处理。


/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {
        if (root == null) return null;
        if (key < root.val) {
            root.left = deleteNode(root.left, key);
            return root;
        }
        if (key > root.val) {
            root.right = deleteNode(root.right, key);
            return root;
        }
        if (root.left != null) {
            TreeNode left = root.left;
            if (left.right == null) {
                left.right = root.right;
                return left;
            }
            while (left.right != null && left.right.right != null) {
                left = left.right;
            }
            if (left.right.left == null) {
                root.val = left.right.val;
                left.right = null;
                return root;
            }
            root.val = left.right.val;
            left.right = left.right.left;
            return root;
        } else {
            return root.right;
        }
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

Leetcode 450. Delete Node in a BST 删除BST中的节点 解题报告

1 解题思想现在有一个二叉搜索树,现在要让你删除一个节点,并且保证整个BST的性质不变。要保证整个性质,我们必须在删除的位置上,找一个合适的值来进行替换,使得BST上的每个节点都满足 当前节点的值大于...
  • MebiuW
  • MebiuW
  • 2017年01月17日 15:15
  • 1070

[leetcode] 450. Delete Node in a BST 解题报告

题目链接: https://leetcode.com/problems/delete-node-in-a-bst/ Given a root node reference of a BST ...
  • qq508618087
  • qq508618087
  • 2016年12月01日 15:24
  • 1733

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 ...
  • liuchenjane
  • liuchenjane
  • 2016年11月11日 22:44
  • 852

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. Retur...
  • alwaystry
  • alwaystry
  • 2017年02月26日 16:32
  • 96

LeetCode 450. Delete Node in a BST

Problem Statement(Source) Given a root node reference of a BST and a key, delete the node with the g...
  • junchen1992
  • junchen1992
  • 2016年11月12日 17:34
  • 346

【LeetCode】 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. Retur...
  • qq_31129455
  • qq_31129455
  • 2017年01月22日 00:05
  • 86

[LeetCode] 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. Retur...
  • sai_j
  • sai_j
  • 2017年07月01日 15:22
  • 70

[Leetcode] 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 B...
  • magicbean2
  • magicbean2
  • 2017年11月13日 14:07
  • 72

[LeetCode]450. Delete Node in a BST

https://leetcode.com/problems/delete-node-in-a-bst/ 删除BST中的指定节点 如果当前节点为要删除的,可以把左子节点或者右子节...
  • gqk289
  • gqk289
  • 2017年02月06日 11:08
  • 105

[leetcode]450. Delete Node in a BST

题目链接:https://leetcode.com/problems/delete-node-in-a-bst/#/description Given a root node reference ...
  • xiaocong1990
  • xiaocong1990
  • 2017年03月28日 11:40
  • 175
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode 450. Delete Node in a BST
举报原因:
原因补充:

(最多只允许输入30个字)