多叉树的前序遍历_LeetCode | 0589. N叉树的前序遍历【Python】

Problem

Given an n-ary tree, return the preorder traversal of its nodes' values.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Follow up:

Recursive solution is trivial, could you do it iteratively?

Example 1:

Input: root = [1,null,3,2,4,null,5,6]

Output: [1,3,5,6,2,4]

复制代码

Example 2:

Input: 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]

Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]

复制代码

Constraints:

The height of the n-ary tree is less than or equal to 1000

The total number of nodes is between [0, 10^4]

问题

给定一个 N 叉树，返回其节点值的前序遍历。

例如，给定一个 3叉树 :

返回其前序遍历: [1,3,5,6,2,4]。

说明: 递归法很简单，你可以使用迭代法完成此题吗?

思路

DFS

Python3 代码

"""

# 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]:

# DFS

res = []

def dfs(root):

if not root:

return

res.append(root.val)

for child in root.children:

dfs(child)

dfs(root)

return res

复制代码

BFS

遍历子树的时候选择的是逆序加入，因为是弹出尾部元素。

复制代码

Python3 代码

"""

# 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]:

# BFS

if not root:

return []

q = [root]

res = []

while q:

# 弹出列表尾部的一个元素

node = q.pop()

res.append(node.val)

# 逆序加入，从右到左

for child in node.children[::-1]:

q.append(child)

return res

复制代码

GitHub 链接