LeetCode菜鸟进化史day8

day8

简单部分的最后几个题

589. N-ary Tree Preorder Traversal

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?

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]

分析

有两种方法，递归与非递归。
递归基本思想：逐层判断，若传入结点为空，则返回所得集合；否则将当前节点的数值传入集合，并运用递归构建该结点的子结点集合，将子节点列表插入集合中， 循环结束返回集合。
非递归基本思想：用到栈，注意我们要把所有子节点逆序放入栈中，因为先进后出！

代码

c++：

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

struct Node
{
   
	int val;
	vector<Node*> children;

	Node():val(NULL), children