Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [3,2,1]
.
1、递归
vector<int> postorderTraversal(TreeNode *root) {
if(root==nullptr) return{};
vector<int> result;
childTravel(root,result);
return result;
}
void childTravel(TreeNode *root,vector<int> &result)
{
if(root==nullptr) return;
childTravel(root->left,result);
childTravel(root->right,result);
result.push_back(root->val);
}
2、递归
vector<int> postorderTraversal(TreeNode *root) {
if(root==nullptr) return{};
vector<int> result;
vector<int> temp=postorderTraversal(root->left);
result.insert(result.begin(),temp.begin(),temp.end());
temp=postorderTraversal(root->right);
result.insert(result.end(),temp.begin(),temp.end());
result.push_back(root->val);
return result;
}
3、非递归,使用栈,会改变二叉树的结构
vector<int> postorderTraversal(TreeNode *root) {
if(root==nullptr) return{};
vector<int> result;
stack<TreeNode*> stackData;
stackData.push(root);
TreeNode* nodeIndex=nullptr;
while(!stackData.empty())
{
nodeIndex=stackData.top();
if(!nodeIndex->left&&!nodeIndex->right)
{
stackData.pop();
result.push_back(nodeIndex->val);
}
else
{
if(nodeIndex->right)
{
stackData.push(nodeIndex->right);
nodeIndex->right=nullptr;
}
if(nodeIndex->left)
{
stackData.push(nodeIndex->left);
nodeIndex->left=nullptr;
}
}
}
return result;
}
4、引入指针记录子节点是否已被访问
vector<int> postorderTraversal(TreeNode *root) {
if(root==nullptr) return{};
vector<int> result;
stack<TreeNode*> stackData;
stackData.push(root);
TreeNode* curNode=nullptr;
TreeNode* preNode=nullptr;
while(!stackData.empty())
{
curNode=stackData.top();
if((!curNode->left&&!curNode->right)||
(preNode&&(preNode==curNode->left||preNode==curNode->right))
)
{
result.push_back(curNode->val);
preNode=curNode;
stackData.pop();
}
else
{
if(curNode->right)
stackData.push(curNode->right);
if(curNode->left)
stackData.push(curNode->left);
}
}
return result;
}