head.h

深度优先搜索二叉树

#ifndef _head_h
#define _head_h




#include "stdio.h"
#include "stdlib.h"


typedef struct node
{
	int value;
	int left;
	int right;
	int parent;
}JD;


#define  N  7

#define  MAX  1000


extern void create_haxi(int array[],JD hafu[]);









#endif