链接:https://leetcode.com/problems/binary-tree-postorder-traversal/
题目:二叉树后序遍历
思路:题目很简单,但是却是Hard难度。。。。。。。。
代码:
class Solution {
public:
void post(TreeNode* root){
if(!root) return;
if(root->left) post(root->left);
if(root->right) post(root->right);
ret.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
post(root);
return ret;
}
private:
vector<int>ret;
};