2023.07.23 Today's Challenge

https://leetcode.com/problems/all-possible-full-binary-trees/

All Possible Full Binary Trees - LeetCode

트리에 대한 문제

class Solution:
    def allPossibleFBT(self, n: int) -> List[Optional[TreeNode]]:
        if not n % 2:
            return []
        if n == 1:
            return [TreeNode()]
        
        res = []
        for i in range(1, n, 2):
            left, right = self.allPossibleFBT(i), self.allPossibleFBT(n-i-1)
            
            for l in left:
                for r in right:
                    root = TreeNode(0, l, r)
                    res.append(root)
        
        return res