/**
* 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) {
vector<int> v;
if(NULL==root) return v;
stack<TreeNode*> s;
s.push(root);
while(!s.empty())
{
TreeNode* node=s.top();
s.pop();
if(NULL!=node) v.emplace_back(node->val);
else continue;
s.push(node->right);
s.push(node->left);
}
return v;
}
};
/**
* 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> v;
stack<TreeNode*> s;
while(NULL!=root || !s.empty())
{
while(root)
{
s.push(root);
root=root->left;
}
root=s.top();
v.emplace_back(root->val);
s.pop();
root=root->right;
}
return v;
}
};
145. 二叉树的后序遍历
后续遍历类似于前序遍历,只是在入栈顺序和最后的向量元素顺序不同罢了
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> v;
stack<TreeNode*> s;
if(NULL==root) return v;
s.push(root);
while(!s.empty())
{
TreeNode* node=s.top();
s.pop();
if(NULL!=node) v.push_back(node->val);
else continue;
s.push(node->left);
s.push(node->right);
}
reverse(v.begin(),v.end());
return v;
}
};