LeetCode/701.cpp at master · chinawch007/LeetCode · GitHub

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
#include<vector>
#include<string>
#include<map>

using namespace std;


struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        if(val > root->val)
        {
            if(root->right)
            {
                insertIntoBST(root->right, val);
            }
            else
            {
                TreeNode* p = new TreeNode(val);
                root->right = p;
            }
        }
        else
        {
            if(root->left)
            {
                insertIntoBST(root->left, val);
            }
            else
            {
                TreeNode* p = new TreeNode(val);
                root->left = p;
            }
        }

        return root;
    }
};