zoukankan      html  css  js  c++  java
  • 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 == null) {
                return root;
            }
            
            //find the target
            if(root.val < key) {
                root.right = deleteNode(root.right, key);
                return root;
            } else if(root.val > key) {
                root.left = deleteNode(root.left, key);
                return root;
            }
            
            //No child or only one child
            if(root.left == null && root.right == null) {
                return null;
            } else if(root.left == null) {
                return root.right;
            } else if(root.right == null) {
                return root.left;
            }
            
            //Two children
            if(root.right.left == null) {
                root.right.left = root.left;
                return root.right;
            } else {
                TreeNode smallest = deleteSmallest(root.right);
                smallest.left = root.left;
                smallest.right = root.right;
                return smallest;
            }
        }
        
        private TreeNode deleteSmallest(TreeNode root) {
            TreeNode cur = root.left;
            TreeNode pre = root;
            while(cur.left != null) {
                pre = cur;
                cur = cur.left;
            }
            pre.left = cur.right;
            return cur;
        }
    }
  • 相关阅读:
    ASP.NET 3.5 的 ListView 控件与 CSS Friendly
    从 Adobe SHARE 说到 Silverlight 的 XPS 支持
    编写 iPhone Friendly 的 Web 应用程序 (Part 5 交互入门)
    初为项目经理
    管理的最高境界不是完美
    url传递中文的解决方案总结
    我想跟什么样的人合作
    异步Socket通信总结
    让机器自动支持中文文件名
    Socket基本编程
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13042569.html
Copyright © 2011-2022 走看看