4 line solution | C++
\nTreeNode* searchBST(TreeNode* root, int val) { \n      if(!root) return NULL;\n      if(root->val == val) return root;\n      if(root->val < val) return searc
```\nTreeNode* searchBST(TreeNode* root, int val) { \n      if(!root) return NULL;\n      if(root->val == val) return root;\n      if(root->val < val) return searchBST(root->right, val);\n      else return searchBST(root->left, val);\n    }\n```
[]