-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0701-InsertIntoABinarySearchTree.cs
56 lines (53 loc) · 1.58 KB
/
0701-InsertIntoABinarySearchTree.cs
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
//-----------------------------------------------------------------------------
// Runtime: 128ms
// Memory Usage: 37.6 MB
// Link: https://leetcode.com/submissions/detail/408819393/
//-----------------------------------------------------------------------------
namespace LeetCode
{
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class _0701_InsertIntoABinarySearchTree
{
public TreeNode InsertIntoBST(TreeNode root, int val)
{
if (root == null) return new TreeNode(val);
var node = root;
while (node != null)
{
if (val < node.val)
{
if (node.left == null)
{
node.left = new TreeNode(val);
return root;
}
else
node = node.left;
}
else
{
if (node.right == null)
{
node.right = new TreeNode(val);
return root;
}
else
node = node.right;
}
}
return root;
}
}
}