根据插入值和节点值的大小,进入二叉搜索树的左子树或者右子树,遇到空节点时,插入即可。第一次写时,没有充分用到递归的返回值这一项,进行了重复的判断和构造:
/**
* 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 == nullptr){
TreeNode * node = new TreeNode(val);
root = node;
}
if(root != nullptr && root->val > val && root->left == nullptr){
TreeNode* node = new TreeNode(val);
root->left = node;
}
if(root != nullptr && root->val < val && root->right == nullptr){
TreeNode* node = new TreeNode(val);
root->right = node;
}
if(root != nullptr && val < root->val){
insertIntoBST(root->left, val);
}
if(root != nullptr && val > root->val){
insertIntoBST(root->right, val);
}
return root;
}
};
优化后的代码如下:
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if(root == nullptr){
TreeNode * node = new TreeNode(val);
return node;
}
if(root->val > val){
root->left = insertIntoBST(root->left, val);;
}
if(root->val < val){
root->right = insertIntoBST(root->right, val);
}
return root;
}
};