使用两个栈来实现。第二个栈先遍历其本身,然后遍历其右孩子,最后遍历其左孩子。这正好与后续遍历相反!所以第二个栈的出栈顺序就是后续遍历的顺序。
C++代码:
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
/**
* @param root: The root of binary tree.
* @return: Postorder in vector which contains node values.
*/
public:
vector<int> postorderTraversal(TreeNode *root) {
vector<int> result;
if (NULL == root){
return result;
}
stack<TreeNode*> sta,out;
TreeNode * temp = root;
sta.push(temp);
while(!sta.empty()){
temp = sta.top();
sta.pop();
out.push(temp);
if(temp->left != NULL){
sta.push(temp->left);
}
if(temp->right != NULL){
sta.push(temp->right);
}
}
while(!out.empty()){
result.push_back(out.top()->val);
out.pop();
}
return result;
}
};