sortedArrayToBTS

这道题是说怎么将一个升序的list转换为高度平衡二叉树的节点

dayadayup:

1,反正记住二叉树的题都用递归就对了

2，就是在用递归时一定要拼命找初始条件，初始结果

class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        length = len(nums)
        if not length:
            return None
        if length == 1:
            root  = TreeNode(nums[0])
            return root
        index = length//2
        root = TreeNode(nums[index])
        root.left = self.sortedArrayToBST(nums[0:index])
        root.right = self.sortedArrayToBST(nums[index + 1:])
        return root