二叉树的前中后遍历以及非递归实现

废话不多说直接上代码，敲了一小时才敲出来，哈哈哈，中序遍历非递归不好想

#include<iostream>
#include<vector>
#include<stack>

using namespace std;

class TreeNode
{
public:
	TreeNode(int data) :val(data) {};
	~TreeNode() {};
public:
	int val;
	TreeNode* left;
	TreeNode* right;
};

TreeNode* creatTree() {
	int a = 0;
	cin >> a;

	if (a == -1)
		return NULL;
	TreeNode* head = new TreeNode(a);
	head->left = creatTree();
	head->right = creatTree();

	return head;
}

/***************************1 递归 : 前序遍历*****************************/
void Print_pre(TreeNode* head) {
	if (head == NULL)
		return;
	cout << head->val << "->";
	Print_pre(head->left);
	Print_pre(head->right);
}

/***************************2 非递归：前序遍历******************************/
//前序遍历是中-左-右，所以压栈肯定先压右边才能先打印左节点，其实跟递归比起来差不多
void Print_pre1(TreeNode* head) {
	stack<TreeNode*> node;
	node.push(head);
	TreeNode* theOne;
	while(!node.empty()){
		theOne = node.top();
		cout << theOne->val << "->";
		node.pop();
		if(theOne->right != NULL) node.push(theOne->right);
		if(theOne->left != NULL) node.push(theOne->left);
	}
	return;
}

/***************************3 递归 : 中序遍历*****************************/
void Print_mid(TreeNode* head) {
	if (head == NULL)
		return;
	Print_mid(head->left);
	cout << head->val << "->";
	Print_mid(head->right);
}

/***************************4 非递归：中序遍历******************************/
//中序遍历是左-中-右，压栈的时候要以此把当前节点的左节点压入栈内，当前结点为null时，开始考虑右节点
void Print_mid1(TreeNode* head) {
	stack<TreeNode*> node;
	while(!node.empty() || head != NULL){
		if(head != NULL){
			node.push(head);
			head = head->left;
		}
		else{
			//当左边走到头了，将当前节点打印，完了将head的右节点赋值给head，开始打印右子树
			head = node.top();
			node.pop();
			cout<< head->val << "->";
			head = head->right;
		}
	}
}

/***************************5 递归 : 后序遍历*****************************/
void Print_las(TreeNode* head) {
	if (head == NULL)
		return;
	Print_las(head->left);
	Print_las(head->right);
	cout << head->val << "->";
}

/***************************6 非递归：后序遍历******************************/
void Print_las1(TreeNode* head) {
	//前序遍历是中-左-右，而后续遍历时中-右-左，所以只要写出中-右-左，用另一个栈保存即可
	stack<TreeNode*> node1;
	stack<TreeNode*> node2;
	node1.push(head);
	TreeNode* theOne;
	while(!node1.empty()){
		theOne = node1.top();
		node2.push(theOne);
		node1.pop();
		if(theOne->left != NULL) node1.push(theOne->left);
		if(theOne->right != NULL) node1.push(theOne->right);
		
	}

	while(!node2.empty()){
		cout<<node2.top()->val<<"->";
		node2.pop();
	}
	return;
}


int main() {
	cout << "请输入要建立的二叉树：1 1 -1 -1" << endl;
	TreeNode* head = creatTree();
	
	cout<<"前序遍历："<<endl;
	Print_pre(head); cout << endl;
	Print_pre1(head); cout << endl;

	
	cout<<"中序遍历："<<endl;
	Print_mid(head); cout << endl;
	Print_mid1(head); cout << endl;
	

	cout<<"后序遍历："<<endl;
	Print_las(head); cout << endl;
	Print_las1(head); cout << endl;
	
	
	system("pause");
	return 0;
}