144.Binary Tree Preorder Traversal
/**
* 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> result;
stack<TreeNode*> stacks;
while(!stacks.empty()||root!=NULL){
if(root){
stacks.push(root);
result.push_back(root->val);
root=root->left;
}
else{
TreeNode* p= stacks.top();
stacks.pop();
root=p->right;
}
}
return result;
}
};
94.Binary Tree Inorder Traversal
/**
* 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> result;
stack<TreeNode*> stacks;
while(!stacks.empty()||root!=NULL){
if(root){
stacks.push(root);
root=root->left;
}
else{
TreeNode* p=stacks.top();
stacks.pop();
result.push_back(p->val);
root=p->right;
}
}
return result;
}
};
145.Binary Tree Postorder Traversal
/**
* 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> result;
stack<TreeNode*> stacks;
while(!stacks.empty()||root){
if(root){
stacks.push(root);
result.insert(result.begin(),root->val);
root=root->right;
}
else{
TreeNode* p=stacks.top();
stacks.pop();
root=p->left;
}
}
return result;
}
};