LC-0095 Medium LeetCode

95. Unique Binary Search Trees II

Dynamic Programming Backtracking Tree Binary Search Tree Binary Tree

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 60% Topics: Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Tree

Reading material

1-D Dynamic Programming 16 min Backtracking 14 min Trees & Traversals 18 min

Reference solution (spoiler · python)

# Time:  O(4^n / n^(3/2)) ~= Catalan numbers
# Space: O(4^n / n^(3/2)) ~= Catalan numbers

class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

    def __repr__(self):
        if self:
            serial = []
            queue = [self]

            while queue:
                cur = queue[0]

                if cur:
                    serial.append(cur.val)
                    queue.append(cur.left)
                    queue.append(cur.right)
                else:
                    serial.append("#")

                queue = queue[1:]

            while serial[-1] == "#":
                serial.pop()

            return repr(serial)

        else:
            return None

class Solution(object):
    # @return a list of tree node
    def generateTrees(self, n):
        return self.generateTreesRecu(1, n)

    def generateTreesRecu(self, low, high):
        result = []
        if low > high:
            result.append(None)
        for i in xrange(low, high + 1):
            left = self.generateTreesRecu(low, i - 1)
            right = self.generateTreesRecu(i + 1, high)
            for j in left:
                for k in right:
                    cur = TreeNode(i)
                    cur.left = j
                    cur.right = k
                    result.append(cur)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT