![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
localhost:8888
这个作者很懒,什么都没留下…
展开
-
C语言 栈的创建、插入、删除、遍历
#include<stdio.h>#include<stdlib.h>typedef struct student{ int data; struct student *pnext;}node,*nodes;typedef struct Stack{ nodes top;//栈顶 nodes bottom;//栈底}*stacks,st;void ...原创 2018-03-19 21:08:44 · 2520 阅读 · 0 评论 -
双向链表建立、插入删除
#include<stdio.h>#include<stdlib.h>typedef struct Node{ struct Node* pre;//指向上一个 int data; struct Node *next;//指向下一个 }STU,*nodes; nodes creatnew()//建立头结点 { nodes head; head=(n...原创 2018-03-20 10:13:05 · 142 阅读 · 0 评论 -
单链表 电话簿
#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct student{ long long int num; char name[20]; char adress[20]; struct student *next;}STU; STU *creatnew()/...原创 2018-03-20 10:14:40 · 1748 阅读 · 1 评论 -
循环链表的建立
#include<stdio.h>#include<stdlib.h>typedef struct student { int data; struct student *next;}STU;STU *creatnew(){ STU *p; p=(STU*)malloc(sizeof(STU)); p->next=p;} STU *cr...原创 2018-03-20 10:16:46 · 748 阅读 · 0 评论 -
单链表合并
#include<stdio.h>#include<stdlib.h>typedef struct Node{ int data; struct Node *next;}*STU,nodes; STU creat_list(STU head){ STU p1,p; int i,num; head->next=NULL; p1=head; p...原创 2018-03-20 14:56:23 · 362 阅读 · 0 评论 -
循环队列的相关操作
#include<stdio.h>#include<stdlib.h>typedef struct queue{ int *base; int front; int rear;}Queue;bool full_queue(Queue *s)//判断队列是否已满 { if((s->rear+1)%6==s->front) return tr...原创 2018-03-25 21:03:18 · 159 阅读 · 0 评论 -
串的链式存储
#include<stdio.h>#include<stdlib.h>typedef struct String{ char ch; struct String *next;}node,*string;bool IsEmpty(string s){ if(s->next==NULL) return true; else return fals...原创 2018-03-28 19:55:44 · 1490 阅读 · 0 评论