Insert into a Binary Search Tree LeetCode solution in C++

1
class Solution {
2
 public:
3
  TreeNode *insertIntoBST(TreeNode *root, int val) {
4
    if (root == NULL) return new TreeNode(val);
5
    TreeNode *node = root;
6
    while (true) {
7
      if (val >= node->val) {
8
        if (node->right)
9
          node = node->right;
10
        else {
11
          node->right = new TreeNode(val);
12
          break;
13
        }
14
      } else {
15
        if (node->left)
16
          node = node->left;
17
        else {
18
          node->left = new TreeNode(val);
19
          break;
20
        }
21
      }
22
    }
23
    return root;
24
  }
25
};