Python | Easy and Fast Solution
```\nclass Solution:\n    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n \n        def solve(left, right):\n            if left > right: r
```\nclass Solution:\n    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:\n \n        def solve(left, right):\n            if left > right: return None\n            m = (left + right)//2\n            return TreeNode(nums[m], solve(left,m-1), solve(m+1,right))\n        return solve(0, len(nums)-1)
['Python']