leetcode

0 class Solution {

1 public:

2 TreeNode *searchBST(TreeNode *root, int val) {

3 while (root && root->val != val) {

4 if (val < root->val)

5 root = root->left;

6 else

7 root = root->right;

8 }

9 return root;

10 }

11 };