N叉树的前、后序遍历（Python）

某工程师$

已于 2022-05-29 14:12:15 修改

阅读量585

点赞数 1

分类专栏：算法 python 文章标签：算法

于 2022-05-29 14:03:07 首次发布

本文链接：https://blog.csdn.net/weixin_37882382/article/details/125030160

版权

python 同时被 2 个专栏收录

47 篇文章 0 订阅

订阅专栏

算法

40 篇文章 1 订阅

订阅专栏

N叉树的前序遍历
 N叉树的后序遍历

递归（由二叉树的递归演化，左右子节点变为子节点列表）

后序

"""
# 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]:
        res_list = []
        def dfs(root: 'Node'):
            if not root:
                return
            for cn in root.children:
                dfs(cn)
            res_list.append(root.val)
        dfs(root)
        return res_list

前序

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

class Solution:
    def preorder(self, root: 'Node') -> List[int]:
        res_list = []
        def dfs(root: 'Node'):
            if not root:
                return
            res_list.append(root.val)
            for cn in root.children:
                dfs(cn)
        dfs(root)
        return res_list

迭代 (其实就是二叉树前、后序遍历常规方法的扩展，左右子节点变成了子节点列表遍历，顺序仍然一致)

后序

"""
# 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]:
        if not root:
            return []
        res_list, stack = [], [(0, root)]
        while stack:
            flag, node = stack.pop()
            if flag == 1:
                res_list.append(node.val)
            else:
                stack.append((1, node))
                for cn in node.children[::-1]:
                    stack.append((0, cn))
        return res_list

前序

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

class Solution:
    def preorder(self, root: 'Node') -> List[int]:
        if not root:
            return []
        res_list, stack = [], [root]
        while stack:
            tmp = stack.pop()
            res_list.append(tmp.val)
            stack.extend(tmp.children[::-1])
        return res_list