首页 > 考试 > 其他 > 正文
LeetCode 450. Delete Node in a BST
2017-01-04 09:19:38       个评论    来源:James Pan  
收藏    我要投稿

原题网址: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;
        }
    }
}


 

点击复制链接 与好友分享!回本站首页
相关TAG标签 LeetCode 编程题
上一篇:【LeetCode】 198. House Robber
下一篇:(HDU5924)Mr.Frog’sProblem思维水题<2016CCPC东北地区大学生程序设计竞赛-重现赛)
相关文章
图文推荐
文章
推荐
热门新闻

关于我们 | 联系我们 | 广告服务 | 投资合作 | 版权申明 | 在线帮助 | 网站地图 | 作品发布 | Vip技术培训
版权所有: 红黑联盟--致力于做实用的IT技术学习网站