✔️ [C++] 3 LINES ´͈ ᵕ `͈ Explained
UPVOTE if you like (\uD83C\uDF38\u25E0\u203F\u25E0), If you have any question, feel free to ask.\n\nRecursively call the method with the node choosed using BST 
**UPVOTE if you like (\uD83C\uDF38\u25E0\u203F\u25E0), If you have any question, feel free to ask.**\n\nRecursively call the method with the node choosed using BST property (small nodes go to the left, grater - to the right).\n\nTime: **O(n)** - in worst case we have linked list\nSpace: **O(n)** - recursive call stack\n\nRuntime: 41 ms, faster than **83.26%** of C++ online submissions for Search in a Binary Search Tree.\nMemory Usage: 34.9 MB, less than **24.22%** of C++ online submissions for Search in a Binary Search Tree.\n\n```\nclass Solution {\npublic:\n    TreeNode* searchBST(TreeNode* root, int val) {\n        if (!root) return NULL;\n        if (root->val == val) return root;\n        return searchBST(root->val > val ? root->left : root->right, val);\n    }\n};\n```\n\n**UPVOTE if you like (\uD83C\uDF38\u25E0\u203F\u25E0), If you have any question, feel free to ask.**
['C']