Leetcode: Unique Binary Search Trees II

Question

Given 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
confused what “{1,#,2,3}” means? > read more on how binary tree is serialized on OJ.

Show Tags
Show Similar Problems
Have you met this question in a real interview? Yes No
Discuss

---

Solution

Analysis

Get idea from 南郭子綦.

Code

# 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]
        """

        return self.helper(1,n)

    def helper(self, left, right):
        if left>right:
            return [None]

        res = []
        for elem in range(left, right+1):
            lefttrees  = self.helper(left, elem-1)
            righttrees = self.helper(elem+1, right)
            for lt in lefttrees:
                for rt in righttrees:
                    newroot = TreeNode(elem)
                    newroot.left  = lt
                    newroot.right = rt
                    res.append(newroot)

        return res