标签:node Insert Search TreeNode val Binary return null root
You are given the root
node of a binary search tree (BST) and a value
to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.
Notice 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.
Example 1:
Input: root = [4,2,7,1,3], val = 5
Output: [4,2,7,1,3,5]
Explanation: Another accepted tree is:
Example 2:
Input: root = [40,20,60,10,30,50,70], val = 25
Output: [40,20,60,10,30,50,70,null,null,25]
Example 3:
Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5
Output: [4,2,7,1,3,5]
基本思路,按照bst的检索准则,左子树的元素都比根结点小,右子树的节点都比根结点大,然后把需要插入的结点放到树的尾端。
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
// recursion
return digui(root,val);
}
TreeNode* digui(TreeNode* node,int val){
// recursion insert to the bottom of the bst
if(node==nullptr){
TreeNode* cur=new TreeNode(val);
return cur;
}
int tmp=node->val;
if(tmp>val){
node->left=digui(node->left,val);
}
else{
node->right=digui(node->right,val);
}
return node;
}
};
标签:node,Insert,Search,TreeNode,val,Binary,return,null,root 来源: https://www.cnblogs.com/aalan/p/15794172.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。