파비의 매일매일 공부기록

2023.02.18 Today's Challenge 본문

Problem Solving/LeetCode

2023.02.18 Today's Challenge

fabichoi 2023. 2. 18. 23:45

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

 

Invert Binary Tree - LeetCode

Invert Binary Tree - Given the root of a binary tree, invert the tree, and return its root.   Example 1: [https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg] Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: [https://assets.lee

leetcode.com

재귀로 앞뒤 바꾸는 로직 호출하면 됨.

class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return root
        self.invertTree(root.left)
        self.invertTree(root.right)
        root.left, root.right = root.right, root.left
        return root
반응형

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

2023.02.20 Today's Challenge  (0) 2023.02.20
2023.02.19 Today's Challenge  (0) 2023.02.19
2023.02.17 Today's Challenge  (0) 2023.02.17
2023.02.16 Today's Challenge  (1) 2023.02.16
2023.02.15 Today's Challenge  (0) 2023.02.15
'Problem Solving/LeetCode' Related Articles more
Comments