qq_46426180的博客

#include <stdio.h>#include <stdlib.h>#define DATATYPE char#define NULL '\0'typedef struct node{ DATATYPE data; struct node *lchild,*rchild;}BTLINK;BTLINK *creat(){ BTLINK *q; BTLINK *s[30]; int j,i; char x; printf("i,x="); scan

#include <stdio.h>#define datatype char#define MAXSIZE 100#define NULL '\0'typedef struct{ datatype data[MAXSIZE]; int top;}SEQSTACK;void initstack(SEQSTACK *s){ s->top=-1;//赋值 }void push(SEQSTACK *s,datatype x)//入栈 { if(s->top

#include <stdio.h>#include <stdlib.h>#define KEYTYPE int#define MAXSIZE 100typedef struct{ KEYTYPE key;}RECORDNODE;void gaosort(RECORDNODE *r,int n){ int i,j; for(i=n-2;i>=0;i--) { r[n]=r[i]; j=i+1; while(r[n].key>r[j].k

#include <stdio.h>#include <stdlib.h>#define DATATYPE char#define NULL '\0'typedef struct node{ DATATYPE data; struct node *lchild,*rchild;}BTLINK;BTLINK *creat(){ BTLINK *q; BTLINK *s[30]; int j,i; char x; printf("i,x="); scan

#include <stdio.h>#include <stdlib.h>#define DATATYPE int#define MAXSIZE 100typedef struct{ DATATYPE data[MAXSIZE]; int len; }SEQUENLIST;void INITATE(SEQUENLIST *L)//初始化线性表，参数L是表的名字 { L->len=0; }void CREAT(SEQUENLIST *L,int n)

/*带头结点的单链表逆置 */#include<stdio.h>#include<stdlib.h>struct node{ int data; struct node* next;};struct node* creat(){ //构造单链表 int i,num; struct node* head; struct node* q; head = (struct node*)malloc(sizeof(struc

#include <stdio.h>#include <stdlib.h>int binSearch1(int* a, int left, int right, int data){ int mid =0; while (left<=right) { mid = (left + right) / 2; if (data == a[mid]) { return mid; } else if (data > a[mid]) {

#include <stdio.h>#include <stdlib.h>#define DATATYPE int#define MAXSIZE 100typedef struct{ DATATYPE data[MAXSIZE]; int len; }SEQUENLIST;void INITATE(SEQUENLIST *L)//初始化线性表，参数L是表的名字 { L->len=0; }void CREAT(SEQUENLIST *L,int n)

#include <stdio.h>#include <stdlib.h>#define DATATYPE int#define MAXSIZE 100typedef struct{ DATATYPE data[MAXSIZE]; int len; }SEQUENLIST;void INITATE(SEQUENLIST *L)//初始化线性表，参数L是表的名字 { L->len=0; }void CREAT(SEQUENLIST *L,int n)