-
Notifications
You must be signed in to change notification settings - Fork 2
/
InsertIntoBST.java
70 lines (62 loc) · 1.88 KB
/
InsertIntoBST.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
package Leetcode;
/**
* @author kalpak
*
* 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 [0, 104].
* -108 <= Node.val <= 108
* All the values Node.val are unique.
* -108 <= val <= 108
* It's guaranteed that val does not exist in the original BST.
*
*/
public class InsertIntoBST {
public static TreeNode insertIntoBST(TreeNode root, int val) {
if(root == null)
return new TreeNode(val);
else if(root.val > val)
root.left = insertIntoBST(root.left, val);
else if(root.val < val)
root.right = insertIntoBST(root.right, val);
return root;
}
private static void printBST(TreeNode root) {
if(root == null)
return;
System.out.print(root.val + " ");
printBST(root.left);
printBST(root.right);
}
public static void main(String[] args) {
TreeNode root = new TreeNode(4);
root.left = new TreeNode(2);
root.right = new TreeNode(7);
root.left.left = new TreeNode(1);
root.left.right = new TreeNode(3);
TreeNode result = insertIntoBST(root, 5);
printBST(result);
}
}