95. Unique Binary Search Trees II

https://leetcode.com/problems/unique-binary-search-trees-ii/description/
类似96. Unique Binary Search Trees，不同在于要求所有二叉搜索树形状，而不只是计算种数

思路：递归。根据二叉搜索树的性质，在[1…n]中依次选择根i（1 <= i <= n），划分出左([1...i-1])右([i+1...n])子树，然后构造子树。

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

class Solution:
    def generateTrees(self, n):
        """
        :type n: int
        :rtype: List[TreeNode]
        """
        if n == 0:  #边界情况
            return []
        res = self.genTrees(1, n)        
        return res

    #辅助函数，返回所有以[start...end]为根的树根节点
    def genTrees(self, start, end):
        List = []
        if start > end:
            return [None]
        elif start == end:
            return [TreeNode(start)]
        else:
            left, right = [], []  #存储i的左右子树根节点
            for i in range(start, end+1):
                #递归划分左右子树
                left = self.genTrees(start, i-1)
                right = self.genTrees(i+1, end)
                #以i为根构建
                for l in left:  #l，r的内外顺序可以反过来
                    for r in right:
                        root = TreeNode(i)
                        root.left = l
                        root.right = r
                        List.append(root)
        return List