[Go] Recursive solution
\nfunc sortedArrayToBST(nums []int) *TreeNode {\n\tif len(nums) == 0 {\n\t\treturn nil\n\t}\n\tmedian := len(nums) / 2\n\treturn &TreeNode{\n\t\tVal:   nums[med
```\nfunc sortedArrayToBST(nums []int) *TreeNode {\n\tif len(nums) == 0 {\n\t\treturn nil\n\t}\n\tmedian := len(nums) / 2\n\treturn &TreeNode{\n\t\tVal:   nums[median],\n\t\tLeft:  sortedArrayToBST(nums[:median]),\n\t\tRight: sortedArrayToBST(nums[median+1:]),\n\t}\n}\n```
[]