二叉树的遍历（递归与非递归）

二叉树的递归遍历的逻辑较简单，写法也简单，递归遍历左子树，递归遍历右子树；对于二叉树的非递归遍历，我们需要借助stack（栈）这种数据结构来存储我们每次遍历到的节点，然后按照一定的顺序弹出。

二叉树的节点结构定义为：

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

下面是二叉树的递归遍历代码：

//先序递归遍历
void preOrder(TreeNode *T) {
	if (T) {
		cout << T->val;
		preOrder(T->left);
		preOrder(T->right);
	}
	else {
		return;
	}
}

//中序递归遍历
void inOrder(TreeNode *T) {
	if (T) {
		inOrder(T->left);
		cout << T->val;
		inOrder(T->right);
	}
	else {
		return;
	}
}

//后序递归遍历
void postOrder(TreeNode *T) {
	if (T) {
		postOrder( T->left);
		postOrder(T->right);
		cout << T->val;
	}
	else {
		return;
	}
}

下面是二叉树的非递归遍历代码：

//先序非递归遍历
void preOrder_1(TreeNode *T) {
	if (T == NULL)
		return;

	stack
   
   
    
     s;
	s.push(T);
	TreeNode* node;

	while (!s.empty()) {
		node = s.top();
		cout << node->val;
		s.pop();

		if (node->right)
			s.push(node->right);
		if (node->left)
			s.push(node->left);
	}

	cout << endl;
}

//中序非递归遍历
void inOrder_1(TreeNode* T) {
	stack
    
    
     
      s;
	TreeNode* node = T;

	while (node != NULL || !s.empty()) {
		while (node != NULL) {
			s.push(node);
			node = node->left;
		}

		node = s.top();
		cout << node->val;
		s.pop();

		if (node->right == NULL)
			node = NULL;
		else
			node = node->right;
	}
	
	cout << endl;
}

//后序非递归遍历
void postOrder_1(TreeNode* T) {
	if (T == NULL)
		return;

	stack
     
     
      
       s;
	stack
      
      
       
        output;

	s.push(T);
	while (!s.empty()) {
		TreeNode* node = s.top();
		output.push(node);
		s.pop();

		if (node->left)
			s.push(node->left);
		if (node->right)
			s.push(node->right);
	}

	while (!output.empty()) {
		TreeNode* temp = output.top();
		cout << temp->val;
		output.pop();
	}

	cout << endl;
}