郑州网站建设讯息,如何建立网站域名,网上支付网站怎摸做,台州建网站思路#xff1a;类似于二叉树的排序#xff0c;这里需要将子树进行依次递归遍历#xff0c;前序遍历也与之类似
/*
// Definition for a Node.
class Node {
public:int val;vectorNode* children;Node() {}Node(int _val) {val _val;}Node(int _val, vectorN…
思路类似于二叉树的排序这里需要将子树进行依次递归遍历前序遍历也与之类似
/*
// Definition for a Node.
class Node {
public:int val;vectorNode* children;Node() {}Node(int _val) {val _val;}Node(int _val, vectorNode* _children) {val _val;children _children;}
};
*/class Solution {
public://用于保存结果vectorint res;vectorint postorder(Node* root) {helper(root);return res;}//递归函数void helper(Node* root){//如果节点为空if(root nullptr) return;//获取当前节点的子节点vectorNode* children root-children;//依次递归调用叶子节点for(int i 0;ichildren.size();i){helper(children[i]);}res.push_back(root-val);}
};
