https://leetcode.com/problems/n-ary-tree-preorder-traversal/
/**
* // Definition for a Node.
* function Node(val, children) {
* this.val = val;
* this.children = children;
* };
*/
/**
* @param {Node} root
* @return {number[]}
*/
var preorder = function(root) {
let res=[], stack = [root];
while(stack.length) {
let cur = stack.shift();
if(!cur) continue;
res.push(cur.val);
stack.unshift(...cur.children);
}
return res;
};
589. N-ary Tree Preorder Traversal 题目链接 589. N-ary Tree P...
589. N-ary Tree Preorder Traversal
https://leetcode.com/problems/n-ary-tree-preorder-traversal/
589. N-ary Tree Preorder Traversal https://leetcode.com/p...
1. N-ary Tree Level Order Traversal Given an n-ary tree, ...
590. N-ary Tree Postorder Traversal 题目链接 590. N-ary Tree ...
环境：python 3.6，scala 2.11.8 题意 N 叉树的先序遍历 分析 与二叉树先序遍历[https...
102. Binary Tree Level Order Traversal N-ary Tree Level O...
Given an n-ary tree, return the level order traversal of ...
本文标题：2020-07-26 589. N-ary Tree Preor
本文链接：https://www.haomeiwen.com/subject/gkwilktx.html
网友评论