class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if(root==NULL)
{
root=new TreeNode(val);
}
if(val>root->val)
{
root->right=insertIntoBST(root->right,val);
}
if(val<root->val)
{
root->left=insertIntoBST(root->left,val);
}
return root;
}
};
Processed:
0.012, SQL:
9
