Simple Java solution
\nclass Solution {\n    public TreeNode searchBST(TreeNode root, int val) {\n        \n        // Case where root is equal to null meaning we have reached the e
```\nclass Solution {\n    public TreeNode searchBST(TreeNode root, int val) {\n        \n        // Case where root is equal to null meaning we have reached the end of the tree traversal\n        if(root == null){\n            return null;\n        }\n        \n        if(root.val == val){\n\t\t\t// Case where root value is equal to value searched, TreeNode found\n            return root;\n        }else if(root.val > val){\n            // Case where the root value is greater than value searched, therefore we have to search on left side\n            return searchBST(root.left, val);\n        }else{\n            // Case where the root value is smaller than value searched, therefore we have to search on right side\n            return searchBST(root.right, val);\n        }\n        \n    }\n}\n```
[]