145. Binary Tree Postorder Traversal
问题:
后序遍历二叉树
思路:
1. 和前边的preorder,inorder不同,直接借助堆栈实现iterative算法似乎有些麻烦。所以先实现了递归(recursion)版本。
2. preorder的顺序是:root->left->right
inorder的顺序是:left->root->right
postorder的顺序是:left->right->root
类似preorder和inorder的做法,直接来做需要使用root来索引left和right,会比较麻烦。但是可以观察到postorder是root->right->left的逆序,而则个顺序和preorder有异曲同工之妙,我们可以轻松实现root->right->left遍历,然后将遍历结果reverse即可!
code:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void postorderHelper(TreeNode* root, vector<int>& list) {
if (!root) return;
postorderHelper(root->left, list);
postorderHelper(root->right, list);
list.push_back(root->val);
}
vector<int> postorderTraversal0(TreeNode* root) {
vector<int> list;
postorderHelper(root, list);
return list;
}
void reverseArr(vector<int>& arr) {
int len = arr.size();
for (int i = 0; i < len/2; i++) {
int tmp = arr[i];
arr[i] = arr[len-1-i];
arr[len-1-i] = tmp;
}
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> list;
TreeNode* p = root;
stack<TreeNode*> st;
while (p || !st.empty()) {
if (p) {
st.push(p);
list.push_back(p->val);
p = p->right;
} else {
p = st.top();
st.pop();
p = p->left;
}
}
reverse(list.begin(), list.end());
//reverseArr(list);
return list;
}
};