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.
Input: root = [4,2,7,1,3], val = 5 Output: [4,2,7,1,3,5] Explanation: Another accepted tree is:
Input: root = [40,20,60,10,30,50,70], val = 25 Output: [40,20,60,10,30,50,70,null,null,25]
Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5 Output: [4,2,7,1,3,5]
- The number of nodes in the tree will be in the range
-10<sup>8</sup> <= Node.val <= 10<sup>8</sup>
- All the values
-10<sup>8</sup> <= val <= 10<sup>8</sup>
- It’s guaranteed that
valdoes not exist in the original BST.
The solution in Java code
Our definition of a TreeNode is as follows:
And our solution can be created as follows: