题目链接:https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/
题目如下:
/**
* 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){//空节点,即此位置该插入新节点
TreeNode* node=new TreeNode(val);
return node;
}
if(root->val>val) root->left=insertIntoBST(root->left,val);//和当前节点比较
else root->right=insertIntoBST(root->right,val);
return root;
}
};