DSA/C++/LeetCode/0701.cpp at main · spycedcoffee/DSA · 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
46
47
48
49
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* ins(TreeNode* root, int val){

        if(!root)
            return new TreeNode(val);

        TreeNode* temp = root;

        while(1){

            if(temp -> val < val){
                if(temp -> right)
                    temp = temp -> right;

                else{
                    temp -> right = new TreeNode(val);
                    break;
                }
            }
            else{
                if(temp -> left)
                    temp = temp -> left;

                else{
                    temp -> left = new TreeNode(val);
                    break;
                }
            }
        }

        return root;
    }

    TreeNode* insertIntoBST(TreeNode* root, int val) {
        return ins(root, val);
    }
};