二叉树的常用三种遍历_三种常见的二叉树-CSDN博客

本文链接：https://blog.csdn.net/patkritLee/article/details/50751930

这篇博客介绍了二叉树的三种遍历方式：先序遍历、中序遍历和后序遍历，并提供了C++实现的详细代码示例。通过先序、中序和后序遍历，可以按照不同顺序访问二叉树的所有节点。

摘要由CSDN通过智能技术生成

struct BTNode{
	int data;
	struct BTNode *lchild, *rchild;
};
typedef struct BTNode  BTnode;
typedef struct BTNode* BiTree;

void preOrder(BTNode *root){
	if (root == NULL){
		return;
	}
	printf("%d",root->data);
	//遍历左子树
	preOrder(root->lchild);
	//遍历右子树
	preOrder(root->rchild);
}
void inOrder(BTNode *root){//中序遍历
	if (root == NULL){
		return;
	}
	//遍历左子树
	preOrder(root->lchild);
	printf("%d", root->data);
	//遍历右子树
	preOrder(root->rchild);
}
void postOrder(BTNode *root){//后序遍历
	if (root == NULL){
		return;
	}
	//遍历左子树
	preOrder(root->lchild);
	
	//遍历右子树
	preOrder(root->rchild);
	printf("%d", root->data);
}
int _tmain(int argc, _TCHAR* argv[])
{
	BTNode t1, t2, t3, t4, t5;
	memset(&t1,0,sizeof(BTNode));
	memset(&t2, 0, sizeof(BTNode));
	memset(&t3, 0, sizeof(BTNode));
	memset(&t4, 0, sizeof(BTNode));
	memset(&t5, 0, sizeof(BTNode));

	t1.data = 1;
	t2.data = 2;
	t3.data = 3;
	t4.data = 4;
	t5.data = 5;

	//建立关系
	t1.lchild = &t2;
	t1.rchild = &t3;
	t2.lchild = &t4;
	t3.lchild = &t5;
	
	//树的遍历
	cout << "先序遍历" << endl;
	preOrder(&t1);
	cout << "中序遍历" << endl;
	inOrder(&t1);
	cout << "后序遍历" << endl;
	postOrder(&t1);
	return 0;
}