给定一个 N 叉树,返回其节点值的后序遍历。
例如,给定一个 3叉树
:
返回其后序遍历: [5,6,3,2,4,1]
.
/*
// 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> ret;
vector<int> postorder(Node* root)
{
if(root == NULL)
return ret;
int size = root->children.size();
for(int i = 0; i < size; i++)
{
postorder(root->children[i]);
}
ret.push_back(root->val);
return ret;
}
};