C simple and short recursive solution
\nstruct TreeNode* searchBST(struct TreeNode* root, int val){\n    if (!root)\n        return NULL;\n    if (root->val == val)\n        return root;\n    if (va
```\nstruct TreeNode* searchBST(struct TreeNode* root, int val){\n    if (!root)\n        return NULL;\n    if (root->val == val)\n        return root;\n    if (val < root->val)\n        return searchBST(root->left, val);\n    else\n        return searchBST(root->right, val);\n}\n```
['C']