[스파르타] 99클럽 2기 코테스터디 18일차 TIL / leet 894

Leetcode: 894. All Possible Full Binary Trees (링크)

 

894. All Possible Full Binary Trees

 

 

 

# 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 allPossibleFBT(self, n: int) -> List[Optional[TreeNode]]:
        dp = { 0: [], 1: [TreeNode()] }
        
        def backtrack(n):
            if n in dp:
                return dp[n]
            
            res = []
            for l in range(n):
                r = n - 1 - l
                leftTrees, rightTrees = backtrack(l), backtrack(r)

                for t1 in leftTrees:
                    for t2 in rightTrees:
                        res.append(TreeNode(0, t1, t2))
            dp[n] = res
            return res

        return backtrack(n)

오늘 미들러 풀이 끝!

---

참고한 풀이: https://www.youtube.com/watch?v=nZtrZPTTCAo