100%  golang solution
```\nfunc searchBST(root TreeNode, val int) TreeNode {\n    if root==nil {\n        return nil\n    }\n    if val==root.Val {\n        return root\n    } else i
```\nfunc searchBST(root *TreeNode, val int) *TreeNode {\n    if root==nil {\n        return nil\n    }\n    if val==root.Val {\n        return root\n    } else if val > root.Val {\n        return searchBST(root.Right,val)\n    } \n    return searchBST(root.Left,val)\n}
['Go']