前序遍历
/**
* 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:
vector<int> preorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> ans;
if(!root)
return ans;
st.push(root);
TreeNode* p;
while(!st.empty())
{
p = st.top();
st.pop();
ans.push_back(p->val);
if(p->right)
st.push(p->right);
if(p->left)
st.push(p->left);
}
return ans;
}
};
中序遍历
/**
* 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:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ans;
if(root!=NULL)
{
stack<TreeNode*> st;
TreeNode* p;
p = root;
while(!st.empty()||p!=NULL)
{
while(p!=NULL)
{
st.push(p);
p = p->left;
}
if(!st.empty())
{
p = st.top();
st.pop();
ans.push_back(p->val);
p = p->right;
}
}
}
return ans;
}
};
后序遍历
/**
* 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:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ans;
if(!root)
return ans;
stack<TreeNode*> st1,st2;
st1.push(root);
while(!st1.empty())
{
TreeNode* p = st1.top();
st1.pop();
st2.push(p);
if(p->left)
st1.push(p->left);
if(p->right)
st1.push(p->right);
}
TreeNode* p;
while(!st2.empty())
{
p = st2.top();
ans.push_back(p->val);
st2.pop();
}
return ans;
}
};