递归与二叉树_leetcode108

最新推荐文章于 2023-10-05 12:17:58 发布

weixin_30484247

最新推荐文章于 2023-10-05 12:17:58 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/lux-ace/p/10546771.html

该博客为转载内容，转载自https://www.cnblogs.com/lux-ace/p/10546771.html ，涉及数据结构与算法领域。

# Definition for a binary tree node.
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
        self.right = None

class Solution(object):
def sortedArrayToBST(self, nums):
"""
        :type nums: List[int]
        :rtype: TreeNode
        """

        size = len(nums)

if size == 0:
return None

        if size == 1:
return  TreeNode(nums[0])

        mid = size / 2

        root = TreeNode(nums[mid])
        root.left = self.sortedArrayToBST(nums[0:mid])
        root.right = self.sortedArrayToBST(nums[mid+1:size])

return root