test1.c

来自「《数据结构-使用C语言》第三版」· C语言 代码 · 共 52 行

#include<stdio.h>
#include<malloc.h>

typedef char DataType;
//#include"BiTreeNode.h"
#include"ThreadBiTree.h"

ThreadBiNode *GetTreeNode(DataType item, ThreadBiNode *left, ThreadBiNode *right)
{
	ThreadBiNode *p;
	p=(ThreadBiNode *)malloc(sizeof(ThreadBiNode));
	
	p->data=item;
	p->leftChild=left;
	
	p->rightChild=right;
	
	return p;
}

void MakeCharTree(ThreadBiNode **root)
{
	ThreadBiNode *b, *c, *d, *e, *f, *g;
	
	g=GetTreeNode('G',NULL, NULL);
	d=GetTreeNode('D',NULL, g);
	b=GetTreeNode('B',d, NULL);
	e=GetTreeNode('E',NULL, NULL);
	f=GetTreeNode('F',NULL, NULL);
	c=GetTreeNode('C',e, f);
	
	*root=GetTreeNode('A',b, c);
}

int main()
{
	ThreadBiNode *root;
	ThreadBiTree tree;
	
	MakeCharTree(&root);
	CreatInThread(&root);
	
	printf("二叉树中序正向遍历序列为:\n");
	ThreadInitiate(&tree, root);
	for(First(&tree); !EndOfNext(&tree); Next(&tree))
	printf("%c ",tree.current->data);
	
	getchar();
	return 0;
}