![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C数据结构
桂亭亭
英雄豪杰,贩夫走卒皆可为友,愿吾与君之共进退。
展开
-
C语言二叉树的相关函数
#include<stdio.h> #include "iostream" #include<stdlib.h> #define Status int #define OK 1 #define ERROR 0 using namespace std; typedef struct BiTNode { char data; struct BiTNode *Lchild,*Rchild; }BiTNode,*Bitree; typedef struct Stack { Bitre.原创 2021-11-29 13:13:22 · 1659 阅读 · 0 评论 -
KMP算法详细代码
#include<stdio.h> #include<string.h> #include<stdlib.h> #define OK 1 #define ERROR 0 #define Sizemax 200 #define Status int typedef struct { char* ch; int Length; }SString; Status InSString(SString& S, SString& T) { S.ch = new.原创 2021-11-14 15:16:02 · 1730 阅读 · 0 评论 -
BF算法详细代码
#include<stdio.h> #include<stdlib.h> #include<iostream> #include<string.h> #define OK 1 #define ERROR 0 #define Sizemax 200 #define Status int using namespace std; typedef struct { char *ch; int Length; }SString; Status InSString.原创 2021-11-14 14:27:24 · 2410 阅读 · 0 评论 -
顺序栈最终版
#include <stdio.h> #include <stdlib.h> #include <iostream> using namespace std; #define OK 1 #define MAXSIZE 100 #define Error 0 #define Status int typedef int ElemType; typedef struct SqStack { ElemType* base; ElemType* top; int stac.原创 2021-11-09 15:52:08 · 1131 阅读 · 0 评论 -
链队最终版
#include<stdio.h> #define OK 1 #define ERROR 0 #define Status int #include <iostream> using namespace std; typedef struct Qnode { int data; struct Qnode* next; }Qnode,*QueuePtr; typedef struct { QueuePtr front; QueuePtr rear; }LinkQueue; .原创 2021-11-09 15:22:58 · 1083 阅读 · 0 评论 -
单链表最终版
#include <stdio.h> #include <stdlib.h> #include "iostream" #define OK 1 #define error 0 #define OVERFLOW -2 using namespace std; typedef char ElemType; typedef int Stauts; typedef struct LNode { ElemType data; struct LNode* next; }LNode, * .原创 2021-11-09 15:15:42 · 1080 阅读 · 0 评论