力扣的不同的二叉搜索树 II 解法 （Python3）

力扣的不同的二叉搜索树 II 解法

题目描述：
给定一个整数 n，生成所有由 1 … n 为节点所组成的二叉搜索树。

示例:

输入: 3
输出:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
解释:
以上的输出对应以下 5 种不同结构的二叉搜索树：

1 3 3 2 1
\ / / / \
3 2 1 1 3 2
/ / \
2 1 2 3
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/regular-expression-matching
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

参考程序1：

# 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: int) -> List[TreeNode]:
        if n == 0:
            return []
        else:
            return self.generateTreesDFS(1, n)
    
    def generateTreesDFS(self, left, right):
        if left > right:
            return [None]
        result = []
        for i in range(left, right + 1):
            leftnodes = self.generateTreesDFS(left, i -  1)  
            rightnodes = self.generateTreesDFS(i + 1, right)  
            for leftnode in leftnodes:
                for rightnode in rightnodes:
                    root = TreeNode(i)
                    root.left = leftnode
                    root.right = rightnode
                    result.append(root)
        return result

运行结果1：

参考程序2：

# 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: int) -> List[TreeNode]:
        if n == 0:
           return []
        Listn = [i for i in range(1, n+1)]
        def generateTreesDFS(List):
            result = []
            if not List:
                return [None]
            if len(List) == 1:
                return [TreeNode(List[0])]
            for k in range(len(List)):
                for left in generateTreesDFS(List[:k]):
                    for right in generateTreesDFS(List[k+1:]):
                        node = TreeNode(List[k])
                        node.left  = left
                        node.right = right
                        result.append(node)
            return result
        return generateTreesDFS(Listn)

运行结果2：

参考程序3：

# 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: int) -> List[TreeNode]:
        if n == 0:
           return []
        def generate(start, end):
            result = []
            for root in range(start, end):
                for left in generate(start, root):
                    for right in generate(root+1, end):
                        node = TreeNode(root)
                        node.left = left
                        node.right = right
                        result.append(node)             
            return result or [None]
        return generate(1,n+1)

运行结果3：