visit.cpp

数据结构的一些简单编程题,二叉树结构

#include<stdio.h>
#include<malloc.h>
typedef struct BiTNode{
	char data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
bool CreateBiTree(BiTree &T){
	char ch;
	
    scanf("%c",&ch);
	if (ch=='0') T=NULL;
	else {
	       T=(BiTNode *)malloc(sizeof(BiTNode));
		   T->data=ch;
		   CreateBiTree(T->lchild);
		   CreateBiTree(T->rchild);
	}return 1;
}
void Preorder(BiTree &T)
{
	 if (T!=NULL)
	 {
	  printf("%c",T->data);
	  Preorder(T->lchild);
	  Preorder(T->rchild);
	 }
}
void Inorder(BiTree &T)
{
	if (T!=NULL)
	{
	  Inorder(T->lchild);
	  printf("%c",T->data);
	  Inorder(T->rchild);
	}
}
void Postorder(BiTree &T)
{
	if (T!=NULL)
	{
		Postorder(T->lchild);
        Postorder(T->rchild);
		printf("%c",T->data);
	}
}
void main()
{   BiTree T=NULL;
	CreateBiTree(T);
	printf("先序序列为：");
	Preorder(T);
	printf("\n");
	printf("中序序列为：");
    Inorder(T);
	printf("\n");
	printf("后序序列为：");
	Postorder(T);
	printf("\n");
}