Package g0701_0800.s0701_insert_into_a_binary_search_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    701 - Insert into a Binary Search Tree.

    Medium

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

    Notice 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.

    Example 1:

    Input: root = 4,2,7,1,3, val = 5

    Output: 4,2,7,1,3,5

    Explanation: Another accepted tree is:

    Example 2:

    Input: root = 40,20,60,10,30,50,70, val = 25

    Output: 40,20,60,10,30,50,70,null,null,25

    Example 3:

    Input: root = 4,2,7,1,3,null,null,null,null,null,null, val = 5

    Output: 4,2,7,1,3,5

    Constraints:

    • The number of nodes in the tree will be in the range <code>0, 10<sup>4</sup></code>.

    • <code>-10<sup>8</sup><= Node.val <= 10<sup>8</sup></code>

    • All the values Node.val are unique.

    • <code>-10<sup>8</sup><= val <= 10<sup>8</sup></code>

    • It's guaranteed that val does not exist in the original BST.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final TreeNode insertIntoBST(TreeNode root, Integer value)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait