class Solution {
public:
vector<int> res;
vector<int> postorderTraversal(TreeNode* root)
{
if(root==NULL)
{
return res;
}
postorder(root);
return res;
}
void postorder(TreeNode* root)
{
if(root==NULL)
return;
postorder(root->left);
postorder(root->right);
res.push_back(root->val);
}
};
145---二叉树后序遍历 难度:中等
最新推荐文章于 2021-10-14 16:49:05 发布