-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
998.cpp
64 lines (61 loc) · 1.68 KB
/
998.cpp
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
__________________________________________________________________________________________________
sample 8 ms submission
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
if(root == NULL) {
return new TreeNode(val);
}
if(root->val < val) {
TreeNode* ret = new TreeNode(val);
ret->left = root;
return ret;
}else {
root->right = insertIntoMaxTree(root->right, val);
return root;
}
}
};
__________________________________________________________________________________________________
sample 12 ms submission
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
if(root->val<val){
TreeNode* newnode=new TreeNode(val);
newnode->left=root;
return newnode;
}
else
{
if(root->right==nullptr) //leaf
{
TreeNode* newnode=new TreeNode(val);
root->right=newnode;
return root;
}
else
root->right=insertIntoMaxTree(root->right,val);
}
return root;
}
};
__________________________________________________________________________________________________