✔Small C++ Code 3 Lines || 75% Faster || Iterative Solution
Please Upvote if you like..:)\n\nclass Solution {\npublic:\n    TreeNode* searchBST(TreeNode* root, int val) {\n        while(root)\n        {\n            if(r
**Please Upvote if you like..:)**\n```\nclass Solution {\npublic:\n    TreeNode* searchBST(TreeNode* root, int val) {\n        while(root)\n        {\n            if(root->val == val) return root;\n            if(root->val >= val) root=root->left;\n            else root=root->right;\n        }\n        return NULL;\n    }\n};\n```
['C']