Buduf/LeetCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

problem 700

Browse Source
This commit is contained in:
Buduf 2022-04-14 13:42:54 +02:00
parent 92b6e2833e
commit b4fb50aeff
1 changed files with 23 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
SearchInABinarySearchTree.cpp Normal file
View File

@ -0,0 +1,23 @@
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) {
while (root != nullptr && root->val != val) {
if (val < root->val) {
root = root->left;
}
else {
root = root->right;
}
}
return root;
}
};