파비의 매일매일 공부기록

Today's Challenge 본문

Problem Solving/LeetCode

Today's Challenge

fabichoi 2022. 9. 6. 23:45

https://leetcode.com/problems/binary-tree-pruning

 

Binary Tree Pruning - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

오랫만에 돌아온 트리 순회 문제

class Solution:
    def pruneTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
    
        def co(node):
            if not node:
                return False

            lco = co(node.left)
            rco = co(node.right)

            if not lco:
                node.left = None
            if not rco:
                node.right = None

            return node.val or lco or rco
    
        return root if co(root) else None
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

Today's Challenge  (0) 2022.09.08
Today's Challenge  (0) 2022.09.07
Today's Challenge  (0) 2022.09.05
Today's Challenge  (0) 2022.09.04
Today's Challenge  (0) 2022.09.03
'Problem Solving/LeetCode' Related Articles more
Comments