题目链接https://leetcode-cn.com/problems/search-in-a-binary-search-tree/
解题代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
if(root==NULL){
return NULL;
}
if(val == root->val){
return root;
}else if(val > root->val){//在右子树上
return searchBST(root->right, val);
}else{//在左子树上
return searchBST(root->left, val);
}
return NULL;
}
};
运行结果