Binary Tree Preorder/postorder Traversal

Binary Tree Preorder Traversal

递归

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution{
public:
	void preorder(TreeNode *root, vector<int> &vec){
		if(root == NULL) return;
		else{
		vec.push_back(root->val);
		preorder(root->left,vec);
		preorder(root->right,vec);
		}
	}
	vector<int> preorderTraversal(TreeNode *root){
		vector<int> vec;
		preorder(root,vec);
		return vec;
	}
};

非递归

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> vec;
		TreeNode *p=root;
		stack<TreeNode*> s;
		while(p!=NULL || !s.empty()){
			while(p!=NULL){
				vec.push_back(p->val);
				s.push(p);
				p=p->left;
			}
			if(!s.empty()){
				p=s.top();
				s.pop();
				p=p->right;
			}
		}
	return vec;
	}
};

Binary Tree Postorder Traversal

递归

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
	void postorder(TreeNode *root, vector<int> &vec){
		if(root == NULL) return;
		else{
			postorder(root->left,vec);
			postorder(root->right,vec);
			vec.push_back(root->val);
		}
	}
    vector<int> postorderTraversal(TreeNode *root) {
		vector<int> vec;
		postorder(root, vec);
		return vec;
    }
};

非递归

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){
		TreeNode *p = root, *r = NULL;
		vector<int> vec;
		stack<TreeNode *> s;
		while(p != NULL || !s.empty()){
			if(p != NULL){
				s.push(p);
				p=p->left;
			}
			else{
				p=s.top();
				if(p->right&&p->right != r){
					p=p->right;
					s.push(p);
					p=p->left;
				}
				else{
					p=s.top();
					s.pop();
					vec.push_back(p->val);
					r=p;
					p=NULL;
				}
			}
		}
	return vec;
	}
};