Day 22 | 235. Lowest Common Ancestor of a BST | 701. Insert into a BST | 450. Delete Node in a BST

最新推荐文章于 2024-07-22 16:27:42 发布

王锴KKKKKKyle

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量123

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kyle313606922/article/details/128490148

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

LeetCode 235. Lowest Common Ancestor of a Binary Search Tree

Question Link

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root.val < p.val && root.val < q.val) return lowestCommonAncestor(root.right, p, q);
        else if(root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left, p, q);
        else return root;
    }  
}

Search the tree from top to bottom. If a node’s value is between p and q, this node is the lowest common ancestor of BST.

LeetCode 701. Insert into a Binary Search Tree

Question Link

class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root == null) 
            return new TreeNode(val);

        if(root.val > val) 
            root.left = insertIntoBST(root.left, val);
        else if(root.val < val) 
            root.right = insertIntoBST(root.right, val);
        return root;
    }
}

In the iteration process， we found a proper position if the current node is null. At this time, we should create a node with val and return it directly.

LeetCode 450. Delete Node in a BST

Question Link

class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {
        // 1、The node to delete wasn't found
        if(root == null) return null;
        if(root.val == key){
            // 2、The node to delete is the leaf node.
            if(root.left == null && root.right == null)
                return null;
            // 3、The node to delete has the left node and doesn't have the right node.
            else if(root.left != null && root.right == null)
                return root.left;
            // 4、The node to delete has the right node and doesn't have the left node.
            else if(root.left == null && root.right != null)
                return root.right;
            // 5、The node to delete has the right and left nodes.
            else{
                TreeNode cur = root.right;
                // Find the left most node
                while(cur.left != null)
                    cur = cur.left;
                // Move the left subtree
                cur.left = root.left;
                // Delete the current node
                root = root.right;
                return root;
            }
        }
        if(root.val > key) root.left = deleteNode(root.left, key);
        if(root.val < key) root.right = deleteNode(root.right, key);
        return root;
    }
}

We need to handle the following five situations：
- 1、The node to delete wasn’t found.
- 2、The node to delete is the leaf node.
- 3、The node to delete has the left node and doesn’t have the right node.
- 4、The node to delete has the right node and doesn’t have the left node.
- 5、The node to delete has the right and left nodes.

王锴KKKKKKyle

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Day 22 | 235. Lowest Common Ancestor of a BST | 701. Insert into a BST | 450. Delete Node in a BST

Day 22 | 235. Lowest Common Ancestor of a BST | 701. Insert into a BST | 450. Delete Node in a BST
复制链接

扫一扫