BFS,令中间位置右边元素(如果数组长度为偶数;数组长度为奇数则就是中间位置元素)作为根节点
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
def helper(left, right):
if(left < right):
mid = (left + right) // 2
root = TreeNode(nums[mid])
root.left = helper(left, mid)
root.right = helper(mid + 1, right)
return root
return helper(0, len(nums))