题目
算法
二叉树递归搜索,没什么好说的
AC代码(c++)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
if(root==NULL)
return NULL;
cout<<root->val<<" "<<val<<endl;
if(root->val==val)
return root;
else if(root->val>val)
return searchBST(root->left, val);
else
return searchBST(root->right, val);
}
};