[LeetCode] 145. Binary Tree Postorder Traversal 문제 풀이

이진 트리(Binary Tree)의 값을 후위 순회(Postorder Traversal)하면서 값을 반환하는 문제입니다.

 

LeetCode : https://leetcode.com/problems/binary-tree-postorder-traversal/description/

Binary Tree Postorder Traversal - LeetCode

 

Code(Python)

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def postorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """

        res = []

        def postorder(root):
            if root:
                if root.left:
                    postorder(root.left)
                if root.right:
                    postorder(root.right)
                res.append(root.val)
        
        postorder(root)

        return res