简单
LIFO:后进先出
返回vector为空: return vector<int>();
或 return {};
(来自和rhb交流时候告诉我的)。
增强for循环和普通for循环都写在了下面,可以对比学习
/*
// 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> res;
vector<int> postorder(Node* root) {
if(!root) return res;
for(auto i:root->children){
postorder(i);
}
/*
for(size_t i=0;i<root->children.size();i++)
postorder(root->children[i]);
*/
res.push_back(root->val);
return res;
}
};