main.c

深度优先搜索二叉树

#include "head.h"
void main()
{
	int array[N] = {2,4,3,8,6,7,9};
	JD  hafu[2*N - 1];
	int i;
	create_haxi(array,hafu);
	printf("\t左节点\t节点值\t右节点\t双亲\n");
	for(i = 0;i < 2*N - 1; i++)
	{
		printf("第%d\t%d\t%d\t%d\t%d\n",i,hafu[i].left,hafu[i].value,hafu[i].right,hafu[i].parent);
	}

}