题目
题解
二叉搜索树的特点
节点的左孩子都比他小,右孩子都比他大
代码
/**
* 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==nullptr||root->val==val)
// return root;
// return root->val>val ? searchBST(root->left,val) : searchBST(root->right,val);
// }
// };
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
while (root != nullptr && val != root->val)
root = val < root->val ? root->left : root->right;
return root;
}
};