590 N叉树的后序遍历

590 N叉树的后序遍历

给定一个 n 叉树的根节点 root ，返回 其节点值的 后序遍历 。

n 叉树 在输入中按层序遍历进行序列化表示，每组子节点由空值 null 分隔（请参见示例）。

输入：root = [1,null,3,2,4,null,5,6]
输出：[5,6,3,2,4,1]

输入：root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
输出：[2,6,14,11,7,3,12,8,4,13,9,10,5,1]

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def postorder(self, root: 'Node') -> List[int]:
        # 非递归
        # result = []
        # st = []
        # if not root:
        #     return []
        # else:
        #     st.append(root)
        #     while st:
        #         node = st.pop()
        #         result.append(node.val)
        #         for i in node.children:
        #             st.append(i)
        # return result[::-1]
        # 递归
        result = []
        def post_order(root):
            if root:
                result.append(root.val)
                for i in root.children[::-1]:
                    post_order(i)
        post_order(root)
        return result[::-1]