# 701. Insert into a Binary Search Tree

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

Note that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.

For example,

``````Given the tree:
4
/ \
2   7
/ \
1   3
And the value to insert: 5
``````

You can return this binary search tree:

``````         4
/   \
2     7
/ \   /
1   3 5
``````

This tree is also valid:

``````         5
/   \
2     7
/ \
1   3
\
4
``````

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

``````class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if (!root) return new TreeNode(val);
TreeNode *cur = root;
while (true) {
if (cur->val > val) {
if (!cur->left) {cur->left = new TreeNode(val); break;}
cur = cur->left;
} else {
if (!cur->right) {cur->right = new TreeNode(val); break;}
cur = cur->right;
}
}
return root;
}
};
``````

Search in a Binary Search Tree

https://leetcode.com/problems/insert-into-a-binary-search-tree/

https://leetcode.com/problems/insert-into-a-binary-search-tree/discuss/150757/java-iterative-100

https://leetcode.com/problems/insert-into-a-binary-search-tree/discuss/164137/Java-easy-to-understand-solution

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation