95. Unique Binary Search Trees II

Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.

For example,
Given n = 3, your program should return all 5 unique BST's shown below.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

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

class Solution(object):
    def generateTrees(self, n):
        """
        :type n: int
        :rtype: List[TreeNode]
        """
        if n == 0:
            return []
        def generate(start,end):
            if start == end:
                return [TreeNode(start)]
            if start > end:
                return [None]
            result = []
            for i in xrange(start,end+1):
                left_list = generate(start,i-1)
                right_list = generate(i+1,end)
                for left_node in left_list:
                    for right_node in right_list:
                        node = TreeNode(i)
                        node.left = left_node
                        node.right = right_node
                        result.append(node)
            return result
        
        return generate(1,n)