Simple recursive solution in C#
```\npublic class Solution {\n    public TreeNode SearchBST(TreeNode root, int val) {\n        if(root == null || root.val == val)\n        {\n             retu
```\npublic class Solution {\n    public TreeNode SearchBST(TreeNode root, int val) {\n        if(root == null || root.val == val)\n        {\n             return root;\n        }\n        \n        if(root.val > val)\n        {\n            return SearchBST(root.left, val);\n        }\n        else\n        {\n            return SearchBST(root.right, val);\n        }\n    }\n}
['Tree', 'Binary Search Tree', 'Recursion', 'C#']