#include <stdio.h>
#include <stdlib.h>
#define MaxSize 10
#define OK 1
#define ERROR 0
#define OVERFLOW -1
#define TRUE 1
#define FALSE 0
typedef char ElemType;/*二叉树的元素为字符型*/
typedef struct TreeNode{
ElemType data;
struct TreeNode *Left;
struct TreeNode *Right;
}BiTNode,*BinTree;
typedef struct {
BinTree *Data;
int rear;/*尾指针,若队列不空,指向队列尾元素的下一个位置*/
int front;/*头指针,若队列不空,指向队列头元素*/
}Queue;
int CreateQueue(Queue *Q)/*构造一个空队列Q*/
{
Q->Data=(BinTree *)malloc (MaxSize*sizeof (BinTree));
if(!(Q->Data))/*存储分配失败*/
exit(OVERFLOW);
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余3页未读,立即下载