二叉树的前中后非递归遍历
算法思想:
前序:定义一个栈,以根右左顺序入栈,再依次出栈
中序:先遍历左子树,再依次取栈顶元素进行回退,直到右子树不空,继续依次入栈
后序:定义两个栈,先将根结点入第二个栈中,再将左右结点按左右顺序入进第一个栈 ,再将其出栈进入第二个栈,第二个栈就是(从栈顶到栈底)右左根的次序,再将第二个栈依次弹栈就是后续遍历
代码
vector<vector<int> > threeOrders(TreeNode* root) {
// write code here
vector<vector<int> >VEC;
VEC.push_back(preorder(root));
VEC.push_back(midorder(root));
VEC.push_back(endorder(root));
return VEC;
}
vector<int> preorder(TreeNode * root)
{
vector<int>vec;
stack<TreeNode*>st;
if (root == nullptr)return vec;
st.push(root);
while(!st.empty())
{
TreeNode *top = st.top();
st.pop();
vec.push_back(top->val);
if(top->right != nullptr)
{
st.push(top->right);
}
if(top->left != nullptr)
{
st.push(top->left);
}
}
return vec;
}
vector<int> midorder(TreeNode *root)
{
vector<int>vec;
stack<TreeNode*>st;
if(root == nullptr)return vec;
while(root != nullptr || !st.empty())
{
while(root != nullptr)
{
st.push(root);
root = root->left;
}
root = st.top();st.pop();
vec.push_back(root->val);
root = root->right;
}
return vec;
}
vector<int>endorder(TreeNode *root)
{
vector<int>vec;
stack<TreeNode*>st1,st2;
if(root == nullptr)return vec;
st1.push(root);
while(!st1.empty())
{
TreeNode *top = st1.top();st1.pop();
st2.push(top);
if(top->left != nullptr)
{
st1.push(top->left);
}
if(top->right != nullptr)
{
st1.push(top->right);
}
}
while(!st2.empty())
{
vec.push_back(st2.top()->val);
st2.pop();
}
return vec;
}