class Solution {
public:
vector<int>v;
void pos(TreeNode* r)
{
if(r)
{
pos(r->left);
pos(r->right);
v.push_back(r->val);
}
}
vector<int> postorderTraversal(TreeNode* root) {
pos(root);
return v;
}
};
加油!