/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode *root) {
vector<int> res;
if(root) {
postorder(res,root);
}
return res;
}
void postorder(vector<int> &res, TreeNode *root) {
if(root->left) {
postorder(res,root->left);
}
if(root->right) {
postorder(res,root->right);
}
res.push_back(root->val);
}
};
[leetcode]Binary Tree Postorder Traversal
最新推荐文章于 2022-07-19 11:52:33 发布