zoukankan      html  css  js  c++  java
  • 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

    Approach #1: C++.[rescursive]

    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        TreeNode* insertIntoBST(TreeNode* root, int val) {
            if (root == nullptr) root = new TreeNode(val);
            if (root->val > val) root->left = insertIntoBST(root->left, val);
            if (root->val < val) root->right = insertIntoBST(root->right, val);
            return root;
        }
    };
    

      

    Approach #2: Java.[iterator]

    /**
     * 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) root = new TreeNode(val);
            TreeNode cur = root;
            while (true) {
                if (cur.val <= val) {
                    if (cur.right != null) cur = cur.right;
                    else {
                        cur.right = new TreeNode(val);
                        break;
                    }
                } else {
                    if (cur.left != null) cur = cur.left;
                    else {
                        cur.left = new TreeNode(val);
                        break;
                    }
                }
            }
            return root;
        }
    }
    

      

    Approach #3: Python.[recursive]

    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    
    class Solution(object):
        def insertIntoBST(self, root, val):
            """
            :type root: TreeNode
            :type val: int
            :rtype: TreeNode
            """
            if not root:
                return TreeNode(val);
            if root.val < val:
                root.right = self.insertIntoBST(root.right, val)
            elif root.val > val:
                root.left = self.insertIntoBST(root.left, val)
            
            return root
    

      

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    ef mysql
    mvc RedirectToAction、mobile 重定向地址栏未改变
    避免复制引用程序集的XML文件
    端口扫描工具
    Python简单全双工聊天器
    Python半双工聊天程序
    Python简单服务器程序
    python+scrapy爬取亚马逊手机商品
    python+scrapy爬取知乎日报全站文章
    简单直接排序
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10011631.html
Copyright © 2011-2022 走看看