m0_57822474的博客

中序遍历的递归与非递归 #include <iostream> using namespace std; typedef struct BiTNode { int data; struct BiTNode *lchild,*rchild; } BiTNode,*BiTree; typedef struct StackNode { BiTNode *t; struct StackNode *next; }StackNode,*LinkStack; bool I

BF算法，KMP算法及其改进 #include <iostream> using namespace std; #define MAXLEN 255 int next[256]; int nextval[256]; typedef struct { char ch[MAXLEN+1]; int length; }SString; int Index_BF(SString S,SString T,int pos) { int i,j; i=pos; j=1; whil

链队的几个基本操作 #include <iostream> using namespace std; typedef struct QNode { int data; struct QNode *next; }QNode,*QueuePtr; typedef struct { QueuePtr front; QueuePtr rear; }LinkQueue; bool Init(LinkQueue &Q) { Q.front=Q.rear=new QNode; Q.fr

循环队列的几个基本操作 #include <iostream> using namespace std; #define MAXSIZE 100 typedef struct { int *base; int front; int rear; }sqQueue; bool Init(sqQueue &Q) { Q.base = new int[MAXSIZE]; if(!Q.base) exit; Q.front=Q.rear=0; return true; } i

链栈的几个基本操作 #include <iostream> using namespace std; typedef struct StackNode { int data; struct StackNode *next; }StackNode,*LinkStack; bool Init(LinkStack &S) { S=NULL; return true; } bool Push(LinkStack &S,int e) { StackNode *p; p =

顺序栈的几个基本操作 #include <iostream> using namespace std; #define MAXSIZE 100 typedef struct { int *base; int *top; int stacksize; }sqStack; bool Init(sqStack &S) { S.base = new int[MAXSIZE]; if(!S.base) exit; S.top=S.base; S.stacksize = MAX

单链表的几个基本操作 #include <iostream> using namespace std; typedef struct LNode { int data; struct LNode *next; }LNode,*LinkList; bool Init(LinkList &L) { L= new LNode; L->next = NULL; return true; } void CreateList(LinkList L,int n) {//前插

顺序表的几个基本操作 #include <iostream> #include <cstdio> #define MAXSIZE 100 using namespace std; typedef struct { int *elem; int length; }SqList; void Init(SqList &L) { L.elem = new int[MAXSIZE]; if(!L.elem) exit; L.length=0; } bool G