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
| class Solution {
public TreeNode insertIntoBST(TreeNode root, int val) {
if (root == null) {
return new TreeNode(val);
}
dfs(root, val);
return root;
}
public void dfs(TreeNode root, int val) {
if (root == null) {
return;
}
if (root.val > val){
if (root.left == null) {
TreeNode node = new TreeNode(val);
root.left = node;
return;
}
dfs(root.left, val);
}
if (root.val < val){
if (root.right == null) {
TreeNode node = new TreeNode(val);
root.right = node;
return;
}
dfs(root.right, val);
}
}
}
|
