Given an n-ary tree, return the preorder traversal of its nodes' values.
For example, given a 3-ary
tree:
Return its preorder traversal as: [1,3,5,6,2,4]
.
Note:
Recursive solution is trivial, could you do it iteratively?
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> preorder(Node* root) {
vector<int> result;
stack<Node*> stackNode;
if(root == nullptr)
return result;
stackNode.push(root);
while(!stackNode.empty())
{
Node* temp = stackNode.top();
stackNode.pop();
result.push_back(temp->val);
for(int i=temp->children.size() - 1; i>=0; i--)
{
stackNode.push(temp->children[i]);
}
}
return result;
}
};