450. 删除二叉搜索树中的节点

struct TreeNode* find_max(struct TreeNode* root)
{
	if (root == NULL)
	{
		return NULL;
	}

	if (root->right != NULL)
	{
		return find_max(root->right);
	}
	else
	{
		return root;
	}
}

struct TreeNode* deleteNode(struct TreeNode* root, int key)
{
	if (root==NULL)
	{
		return NULL;
	}

	if (key<root->val)
	{
		root->left=deleteNode(root->left, key);
	}
	else if (key>root->val)
	{
		root->right=deleteNode(root->right, key);
	}
	else
	{
		struct TreeNode* temp = malloc(sizeof(struct TreeNode));
		if (root->left!=NULL&&root->right!=NULL)
		{
			temp = find_max(root->left);
			root->val = temp->val;
			root->left=deleteNode(root->left, root->val);
		}
		else
		{
			temp = root;
			if (root->left!=NULL)
			{
				root = root->left;
			}
			else if (root->right!=NULL)
			{
				root = root->right;
			}
			else
			{
				root = NULL;
			}
			free(temp);
		}
	}

	return root;
}