Search in a Binary Search Tree C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    TreeNode* searchBST(TreeNode* root, int val) {\n        TreeNode* temp=root;\n        while(temp!=NULL){\n            if(temp->val==val)return temp;\n            else if(temp->val<val)temp=temp->right;\n            else temp=temp->left;\n        }\n        return temp;\n    }\n};\n```
['Tree', 'Binary Search Tree', 'Binary Tree', 'C++']