/**
* // Definition for a Node.
* function Node(val,children) {
* this.val = val;
* this.children = children;
* };
*/
/**
* @param {Node} root
* @return {number[]}
*/
var preorder = function(root) {
let ret = []
const traversal = root => {
if(!root) return
ret.push(root.val)
root.children.forEach(t => {
traversal(t)
})
}
traversal(root)
return ret
};
LeetCode - 589. N叉树的前序遍历
最新推荐文章于 2022-03-10 16:38:28 发布