95 不同的二叉搜索树

95 不同的二叉搜索树

# 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 generateTrees(self, n: int) -> List[TreeNode]:
        if n == 0:
            return []
        def left_right_tree(left,right):
            all_tree = []
            if left > right:
                return [None]
            for i in range(left,right+1):
                left_trees = left_right_tree(left,i-1)
                right_trees = left_right_tree(i+1,right)
                for l in left_trees:
                    for r in right_trees:
                        cur_tree = TreeNode(i)
                        cur_tree.left = l
                        cur_tree.right = r
                        all_tree.append(cur_tree)
            return all_tree
        return left_right_tree(1,n)

利用了二叉搜索树的特点和递归算法，注意在python里二叉树的语法以及return [None]