说好的递归,为啥题解里都是用栈队列秀操作?
二叉树的后序遍历
http://www.nowcoder.com/questionTerminal/32af374b322342b68460e6fd2641dd1b
我就乖乖递归了
vector<int> postorderTraversal(TreeNode* root) { // write code here static vector<int> res; if(!root)return res; postorderTraversal(root->left); postorderTraversal(root->right); res.push_back(root->val); return res; }