简单题。递归和迭代两种解法
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
while(root)
{
if(root->val==val)
return root;
else if(root->val<val)
root=root->right;
else
root=root->left;
}
return NULL;
}
};
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
if(!root)
return NULL;
if(root->val==val)
return root;
if(root->val<val)
return searchBST(root->right,val);
return searchBST(root->left,val);
}
};