LeetCode 701. Insert into a Binary Search Tree

原题链接在这里:https://leetcode.com/problems/insert-into-a-binary-search-tree/

题目:

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

Note that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.

For example, 

Given the tree:
        4
       / \
      2   7
     / \
    1   3
And the value to insert: 5

You can return this binary search tree:

         4
       /   \
      2     7
     / \   /
    1   3 5

This tree is also valid:

         5
       /   \
      2     7
     / \   
    1   3
         \
          4

题解:

If root.val < val, then must insert on root right side, if root right side is already null, then root.right = new TreeNode(val). Otherwise, keep iterating on root.right.

Vice versa.

Time Complexity: O(h). h is height of tree.

Space: O(1).

AC Java: 

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

 

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/11015910.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值