108. Convert Sorted Array to Binary Search Tree——tree

题目分析:二叉树的高度差不能超过1 class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None class Solution(object): def sortedArrayToBST(self, num
相关文章
相关标签/搜索