DataStructure
文章平均质量分 76
普通网友
这个作者很懒,什么都没留下…
展开
-
ReverseLinkedList
#include#includetypedef struct Node{ int data; struct Node * next; }LNode,*LinkedList;LinkedList L;LinkedList LinkedListInit(LinkedList L) {// init linkedlist int x; LNode *p; LinkedList r; L=(L原创 2009-06-24 22:49:00 · 319 阅读 · 0 评论 -
UnionLinkedList
#include#includetypedef struct Node { int data; struct Node *next; }LNode,*LinkedList;LinkedList la,lb,lc;LinkedList LinkedListInit(LinkedList L) {// init linkedlist int x; LNode *p; Link原创 2009-06-24 22:54:00 · 345 阅读 · 0 评论 -
BiTree
#include#includetypedef struct BiNode{ char data; struct BiNode *lchild, *rchild;}BiNode, *BiTree;BiTree T;int count=0;void PreOrderTraverse(BiTree T){//前序遍历二叉树T的递归算法,Visit是访问数据元素的函数 if(T) { /原创 2009-06-24 22:56:00 · 958 阅读 · 0 评论 -
LinkedList
#include#includetypedef struct Node { int data; struct Node *next; }LNode,*LinkedList;//初始化 LinkedList LinkedListInit() {// init linkedlist int x; LinkedList L; //define linkedlist LN原创 2009-06-24 22:48:00 · 686 阅读 · 0 评论 -
Calculate
#include#include#define MAXSIZE 20typedef struct { char data[MAXSIZE]; int top;}SeqStack;SeqStack optr, opnd, R;void change(char s1[30],char s2[30]);int Priority(char ch);void SeqStackInit(SeqSt原创 2009-06-24 22:55:00 · 760 阅读 · 0 评论 -
HString
#include#include#includetypedef struct{ char* str; int length;}HString;HString * StringAssign(HString* S, HString* T){//将T的值赋给S; int len,i; if(S->str) free(S->str); len = T->length; S->length原创 2009-06-24 22:57:00 · 951 阅读 · 0 评论 -
MGraph
#include #include #define INFINITY 32767 #define MAX_VEX 20 //最大顶点个数 #define MAXSIZE 20typedef struct { int data[MAXSIZE]; int front,rear;}SeQueue;//图的邻接矩阵存储结构 typedef struct{ char *vexs; //顶点向原创 2009-06-24 22:58:00 · 1382 阅读 · 1 评论 -
Seqlist
#include #include //#include //about bool #define MAXSIZE 100#define ElemType inttypedef struct { ElemType data[MAXSIZE]; int last; }Seqlist;Seqlist SeqlistInit() { Seqlist L; L.last=0; return原创 2009-06-24 22:44:00 · 863 阅读 · 0 评论