700. 二叉搜索树中的搜索

//递归
struct TreeNode* searchBST(struct TreeNode* root, int val)
{
	if (root == NULL)
	{
		return NULL;
	}

	if (val < root->val)
	{
		return find(root->left, val);
	}
	else if (val > root->right)
	{
		return find(root->right, val);
	}
	else
	{
		return root;
	}
}

//迭代
struct TreeNode* searchBST(struct TreeNode* root, int val)
{
	while (root!=NULL)
	{
		if (val<root->val)
		{
			root = root->left;
		}
		else if(val>root->val)
		{
			root = root->right;
		}
		else
		{
			return root;
		}
	}

	return NULL;
}