给定一个 n 叉树的根节点 root ,返回 其节点值的 前序遍历 。
n 叉树 在输入中按层序遍历进行序列化表示,每组子节点由空值 null 分隔(请参见示例)。
Given the root of 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)
示例 1:
输入:root = [1,null,3,2,4,null,5,6]
输出:[1,3,5,6,2,4]
示例 2:
输入: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]
输出:[1,2,3,6,7,11,14,4,8,12,5,9,13,10]
提示:
- 节点总数在范围 [0, 104]内
- 0 <= Node.val <= 104
- n 叉树的高度小于或等于 1000
每次递归时,先访问根节点,然后依次递归访问每个孩子节点即可。
var preorder = function (root) {
let ans = []
helper(root, ans)
return ans
};
var helper = function (root, ans) {
if (!root) return
ans.push(root.val)
for (let child of root.children) {
helper(child, ans)
}
}
leetcode:https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/