Leetcode590N-ary Tree Postorder TraversalN叉樹的後序遍歷
阿新 • • 發佈:2018-11-06
給定一個 N 叉樹,返回其節點值的後序遍歷。
class Node { public: int val; vector<Node*> children; Node() {} Node(int _val, vector<Node*> _children) { val = _val; children = _children; } }; class Solution { public: vector<int> res; vector<int> postorder(Node* root) { if(root == NULL) return res; Fun(root); return res; } void Fun(Node* root) { if(root == NULL) return; int len = root ->children.size(); for(int i = 0; i < len; i++) { if(root ->children[i] != NULL) Fun(root ->children[i]); } res.push_back(root ->val); } };