zoukankan      html  css  js  c++  java
  • LF.51.Insert In Binary Search Tree

    Insert a key in a binary search tree if the binary search tree does not already contain the key. Return the root of the binary search tree.
    
    Assumptions
    
    There are no duplicate keys in the binary search tree
    
    If the key is already existed in the binary search tree, you do not need to do anything
    
    Examples
    
            5
    
          /    
    
        3        8
    
      /   
    
     1     4
    
    insert 11, the tree becomes
    
            5
    
          /    
    
        3        8
    
      /           
    
     1     4       11
    
    insert 6, the tree becomes
    
            5
    
          /    
    
        3        8
    
      /        /  
    
     1     4   6    11

    DFS recursive:

     1 public class Solution {
     2   public TreeNode insert(TreeNode root, int key) {
     3     // Write your solution here
     4     //this is the base case
     5     if (root == null ) {
     6         return new TreeNode(key) ;
     7     }
     8     if (root.key == key){
     9         return root ;
    10     }
    11     if (root.key > key) {
    12         //go to left
    13         root.left = insert(root.left, key) ;
    14     }
    15     if (root.key < key ) {
    16         //go to right
    17         root.right = insert(root.right, key) ;
    18     }
    19     //back -> upper -> upper upper to the top then return
    20     return root ;
    21   }
    22 }

    since this is called tail recursion, you are recommended to do it in interative: time: O(h) space: O(1)

    Interative:

    /*iterative: time o(h) space: o(1)
      note, here requires: Return the root of the binary search tree.
      so you need to maintain the reference of the root
      */
      public TreeNode insert_iter2(TreeNode root, int key) {
        // Write your solution here
        //this is the base case
        TreeNode newNode = new TreeNode(key);
        if (root == null ) {
            return newNode;
        }
        TreeNode curr = root ;
        while(curr != null){
            if (curr.key == key) {
                return root ; //do nothing
            } else if(curr.key < key){
                if (curr.right == null) {
                    curr.right = newNode;
                    break ;
                } else{
                    curr = curr.right ;
                }
            } else {
                if (curr.left == null) {
                    curr.left = newNode ;
                    break ;
                } else {
                    curr = curr.left ;
                }
            }
        }
        //return the root
        return root ;
      }
  • 相关阅读:
    Winform 打包,卸载程序制作获取ProductCode
    委托/事件的重写
    反序列化无法找到程序集
    Control.Invoke注意事项
    操作config文件
    MemoEdit自动滚动到结尾
    读取局域网内的共享文件
    命令行卸载程序
    获取执行程序的路径
    SCSF 系列:使用 Visualizer 监控 SCSF 运行状态
  • 原文地址:https://www.cnblogs.com/davidnyc/p/8655269.html
Copyright © 2011-2022 走看看