0
点赞
收藏
分享

微信扫一扫

589. N 叉树的前序遍历

北邮郭大宝 2022-07-04 阅读 32

589. N 叉树的前序遍历_树

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


举报

相关推荐

0 条评论