前序遍历
/**
* 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 {
private:
void preorder(TreeNode* t, vector<int>& ret) {
if(t == NULL) {
return;
}
ret.push_back(t->val);
preorder(t->left, ret);
preorder(t->right, ret);
}
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ret;
//preorder(root, ret);
//迭代方法
stack<TreeNode*> s;
TreeNode* t;
if(root == NULL) {
return ret;
}
s.push(root);
while(!s.empty()) {
t = s.top();
ret.push_back(t->val);
s.pop();
if(t->right != NULL) {
s.push(t->right);
}
if(t->left != NULL) {
s.push(t->left);
}
}
return ret;
}
};
/**
* 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 {
private:
void preorder(TreeNode* t, vector<int>& ret) {
if(t == NULL) {
return;
}
ret.push_back(t->val);
preorder(t->left, ret);
preorder(t->right, ret);
}
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ret;
//preorder(root, ret);
//迭代方法
stack<TreeNode*> s;
TreeNode* cur = root;
while(cur != NULL || !s.empty()) {
while(cur) {
s.push(cur);
ret.push_back(cur->val);
cur = cur->left;
}
cur = s.top();
s.pop();
cur = cur->right;
}
return ret;
}
};
中序遍历
/**
* 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 {
private:
void inorder(TreeNode* t, vector<int>& ret) {
if(t == NULL) {
return;
}
inorder(t->left, ret);
ret.push_back(t->val);
inorder(t->right, ret);
}
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ret;
//inorder(root, ret);
//迭代
stack<TreeNode*> s;
TreeNode* cur = root;
while(cur != NULL || !s.empty()) {
while(cur) {
s.push(cur);
cur = cur->left;
}
cur = s.top();
s.pop();
ret.push_back(cur->val);
cur = cur->right;
}
return ret;
}
};
后序遍历
/**
* 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 {
private:
void postorder(TreeNode* t, vector<int>& ret) {
if(t == NULL) {
return;
}
postorder(t->left, ret);
postorder(t->right, ret);
ret.push_back(t->val);
}
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ret;
//postorder(root, ret);
//迭代方法
stack<TreeNode*> s1;
stack<TreeNode*> s2;
TreeNode* t;
if(root == NULL) {
return ret;
}
s1.push(root);
while(!s1.empty()) {
t = s1.top();
s1.pop();
s2.push(t);
if(t->left) {
s1.push(t->left);
}
if(t->right) {
s1.push(t->right);
}
}
while(!s2.empty()) {
t = s2.top();
s2.pop();
ret.push_back(t->val);
}
return ret;
}
};