108. 将有序数组转换为二叉搜索树 - 力扣（LeetCode）
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:if not nums:return Nonemid = len(nums) // 2root = TreeNode(nums[mid])root.left = self.sortedArrayToBST(nums[:mid]) # 左半部分递归root.right = self.sortedArrayToBST(nums[mid+1:]) # 右半部分递归return root
