590. N-ary Tree Postorder Traversal
题目描述：
Given an n-ary tree, return thepostordertraversal of its nodes' values.
For example, given a3-arytree:
Return its postorder traversal as:[5,6,3,2,4,1].
解题思路：
递归方法后序排序。
代码：
1 /* 2 // Definition for a Node. 3 class Node { 4 public: 5 int val; 6 vector<Node*> children; 7 8 Node() {} 9 10 Node(int _val, vector<Node*> _children) { 11 val = _val; 12 children = _children; 13 } 14 }; 15 */ 16 class Solution { 17 public: 18 vector<int> postorder(Node* root) { 19 vector<int> ret; 20 ret.reserve(1000); 21 post(root, ret); 22 return ret; 23 } 24 void post(Node* root, vector<int>& ret) { 25 if (root == NULL) 26 return; 27 for (auto node : root->children) { 28 post(node, ret); 29 } 30 ret.push_back(root->val); 31 } 32 };优质内容筛选与推荐>>
1、Python IO编程
2、vmdk虚拟机转换为OVF模板，导入esxi
3、Eric Linux - 1 Basic concepts of linux
4、实验一
5、codeforces 560 D. Equivalent Strings(分治)