inorder.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 Inorder(BiTree &T)
{
	BiTree stack[100],p;
	int top=0;
	p=T;
    do
	{
		while (p!=NULL)
		{
			top++;
			stack[top]=p;
			p=p->lchild;
		}
		if (top>0)
		{ 
			p=stack[top];
			top--;
			printf("%c",p->data);
			p=p->rchild;
		}
	}while ((p!=NULL)||(top!=0));
}
void main()
{  
	BiTree T=NULL;
	CreateBiTree(T);
	printf("中序序列为：");
	Inorder(T);
	printf("\n");
}