C beats 100% concise method using recursion
\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     struct TreeNode *left;\n *     struct TreeNode *right;\n * };\n */\n
```\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     struct TreeNode *left;\n *     struct TreeNode *right;\n * };\n */\nstruct TreeNode* searchBST(struct TreeNode* root, int val) {\n    if(root){\n        if(root->val == val)\n            return root;\n        else if(root->val > val)\n            return searchBST(root->left, val);\n        else\n            return searchBST(root->right, val);\n    }\n    return NULL;\n}\n```
[]