Leetcode做题日记：108. Convert Sorted Array to Binary Search Tree(PYTHON)

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.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

  0
 / \

-3 9
/ /
-10 5
第一次的代码：
递归求解，题目要我们根据递增列表构造平衡二叉搜索树，左右子树深度差小于1.
取列表中间值为根，左右部分为左右子树，即小的在左，大的在右。

		def t(n):
            if not n:#空则表明没有叶子
                return None
            index=len(n)//2#选区根节点
            root=TreeNode(n[index])
            root.left=t(n[:index])#构造左右树
            root.right=t(n[index+1:])
            return root
        return t(nums)

64ms，排名89%