Leetcode Convert Sorted Array to Binary Search Tree Python 如何把数组转化为BST(二叉搜索树)，经典的二叉树操作。

Leetcode 108题 Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

---

题目大意： 把一个数组转换成BST（二叉搜索树），中间的元素为根节点，左边的全为左节点，右边的全为右节点。

没什么好说的，递归循环。经典的二叉树处理操作。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
        if not nums: return None
        length = len(nums)
        mid = length // 2
        root = TreeNode(nums[mid])
        root.left = self.sortedArrayToBST(nums[:mid])
        root.right = self.sortedArrayToBST(nums[mid+1:])
        return root

看来二叉树方面还是弱项，
第二轮再着重复习！

疫情中的英国，
加油！
03/05/2020