leetcode

0 class Solution {

1 public:

2 TreeNode *insertIntoBST(TreeNode *root, int val) {

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

4

5 TreeNode *prev = nullptr;

6 for (TreeNode *tmp = root; tmp;) {

7 prev = tmp;

8 tmp = val < tmp->val ? tmp->left : tmp->right;

9 }

10

11 (val > prev->val ? prev->right : prev->left) = new TreeNode(val);

12 return root;

13 }

14 };