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

https://leetcode.com/problems/delete-node-in-a-bst/ 删除BST中的指定节点 如果当前节点为要删除的,可以把左子节点或者右子节...

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...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

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

题目链接: https://leetcode.com/problems/delete-node-in-a-bst/ Given a root node reference of a BST ...

LeetCode 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. Retur...

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

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

Leetcode-450. Delete Node in a BST

前言:为了后续的实习面试,开始疯狂刷题,非常欢迎志同道合的朋友一起交流。因为时间比较紧张,目前的规划是先过一遍,写出能想到的最优算法,第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN...

LeetCode Peoject 450.Delete Node in a BST

450.Delete Node in a BST

Leetcode 450. Delete Node in a BST (Medium) (cpp)

Leetcode 450. Delete Node in a BST (Medium) (cpp)

【LeetCode450】Delete Node in BST二叉搜索树删除节点

一、原题重现 题干中给定一个二叉搜索树(BST)的根节点以及一个给定的值,要求我们删除BST中与该值相等的节点,并且删除节点后,该树仍旧满足二叉搜索树的性质。下面举出一个例子 root = [...

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...
  • teffi
  • teffi
  • 2016-12-27 19:06
  • 75
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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