# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
#
# @param num int整型一维数组
# @return TreeNode类
#
class Solution:
def sortedArrayToBST(self , num ):
if len(num) == 0:
return None
if len(num) == 1:
return TreeNode(num[0])
idx = len(num) // 2
node = TreeNode(num[idx])
node.left = self.sortedArrayToBST(num[:idx])
node.right = self.sortedArrayToBST(num[idx+1:])
return node
07-03
4112
10-04
358