Go recursive
\nfunc sortedArrayToBST(nums []int) *TreeNode {\n    if len(nums) == 0 {\n        return nil\n    }\n    return &TreeNode{\n        Val: nums[len(nums)/2],\n   
```\nfunc sortedArrayToBST(nums []int) *TreeNode {\n    if len(nums) == 0 {\n        return nil\n    }\n    return &TreeNode{\n        Val: nums[len(nums)/2],\n        Left: sortedArrayToBST(nums[:len(nums)/2]),\n        Right: sortedArrayToBST(nums[len(nums)/2 + 1:]),\n    }\n}\n```
[]