leetcode---C++实现---589. N-ary Tree Preorder Traversal（N叉树的前序遍历）

题目

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?

Example 1:

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]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal

解题思路

二叉树前序遍历的非递归实现借助了栈来实现，此题中多叉树的前序遍历仍借助栈来实现，不同点在于二叉树有left和right儿子节点，而多叉树中儿子节点数量不定；怎么保证从栈中弹出节点的顺序与前序遍历顺序保持一致，是需要考虑的事情。

1. 将root节点压入栈中；
2. 从栈中弹出树节点元素，将当前节点的值添加至输出vector中；
3. 将当前节点的儿子节点倒序压入栈中（可保证弹出节点的顺序与前序遍历顺序一致），继续步骤2；

算法实现

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val) {
        val = _val;
    }

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
public:
    vector<int> preorder(Node* root) {
    	vector<int> retVector;
    	if (!root)
    		return retVector;
    	Node* curNode = root;
   		stack<Node*> nodeStack;
   		nodeStack.push(curNode);
   		while (!nodeStack.empty())
   		{
   			curNode = nodeStack.top();
   			nodeStack.pop();
   			if (!curNode)
   				continue;
   			retVector.push_back(curNode->val);
   			for (int i = curNode->children.size() - 1; i >= 0; ++i)
   			{
   				nodeStack.push(curNode->children[i]);
   			}
   		}
   		return retVector;
    }
}