最小高度树

1 class Solution:
2     def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
3         if not nums :
4             return 
5         mid=len(nums)//2
6         root=TreeNode(nums[mid])
7         root.left=self.sortedArrayToBST(nums[:mid])
8         root.right=self.sortedArrayToBST(nums[mid+1:])
9         return root