108. Convert Sorted Array to Binary Search Tree [ 将有序数组转换为二叉搜索树]

描述

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

给一个递增数组，造出来一个平衡二叉树
平衡二叉树=二叉搜索树（左子树都比根小，右子树都比根大）+左右子树高度不超过1

例子

思路

• 递归

对于每个结点，从递增数组中取中间值【可以是选择中间偏左，或中间偏右作为根节点都可以】作为其值，然后将该数组分为两部分，分别采用递归的方法构建左右子树

答案

• python

class Solution:
    def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
        
        if len(nums)==0:
            return None
        
        m