根据二叉树的性质,很好判断
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
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 == nullptr)return NULL;
if (root->val == val)return root;
if (val < root->val)return searchBST(root->left, val);
else return searchBST(root->right, val);
}
};
void print(TreeNode* a) {
if(a != nullptr){
cout << a->val;
print(a->left);
print(a->right);
}
}
int main() {
Solution test;
TreeNode* c = new TreeNode(1);
TreeNode* b = new TreeNode(3);
TreeNode* a = new TreeNode(2,c, b);
cout << test.searchBST(a, 3);
}