无限不循环

#include "stdio.h" #include "string.h" #include "malloc.h" #define NULL 0 #define MAXSIZE 30 typedef struct BiTNode      //定义二叉树数据结构 {     char data;     struct BiTNode *lchild,*rchild; } BiT

#include "stdio.h" #include "string.h" #include "malloc.h" #define NULL 0 #define MAXSIZE 30 typedef struct BiTNode      //定义二叉树数据结构 {     char data;     struct BiTNode *lchild,*rchild; } BiT

//折半2015.7.13 02:38 #include #include #include #define MAXSIZE 10000 typedef struct seqNode {     int data[MAXSIZE];     int n; }seqNode; void createSeq(seqNode *& seq) {     seq=(seqNode

#include #include //malloc realloc函数头文件 #define STACK_INIT_SIZE 100//栈初始分配大小 #define STACKINCREAM 10 //栈内存扩展增量 typedef int ElemType; typedef struct { ElemType *base; ElemType *top; int st

//代码如下：#include#includetypedef struct Node //二叉树结构定义{ char data; struct Node *lchild; struct Node *rchild;}Bitree; void CreateBiTree(Bitree *&t) //先序遍历创建二叉树{ char s; scanf("%c",&s); if(s=