struct TreeNode* insertIntoBST(struct TreeNode* root, int val)
{
if (root==NULL)
{
root = malloc(sizeof(struct TreeNode));
root->val = val;
root->left = root->right = NULL;
}
if (val<root->val)
{
root->left = insertIntoBST(root->left, val);
}
else if (val>root->val)
{
root->right = insertIntoBST(root->right, val);
}
return root;
}
701. 二叉搜索树中的插入操作
最新推荐文章于 2024-03-12 21:30:47 发布