2022_problem/insertElementInBst.cpp at main · Dhruvk13/2022_problem · 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
/**
 * 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 *insertIntoBST(TreeNode *root, int val)
    {
        if (root == NULL)
            return new TreeNode(val);
        TreeNode *curr = root;
        while (true)
        {
            if (curr->val <= val)
            {
                if (curr->right)
                    curr = curr->right;
                else
                {
                    TreeNode *newNode = new TreeNode(val);
                    curr->right = newNode;
                    break;
                }
            }
            else
            {
                if (curr->left)
                    curr = curr->left;
                else
                {
                    TreeNode *newNode = new TreeNode(val);
                    curr->left = newNode;
                    break;
                }
            }
        }
        return root;
    }
};