![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
while(1){}
------------------
展开
-
单向链表 增 删 改 查
#include <stdio.h>#include <malloc.h>typedef struct node { int num; node* next;} NODE;int lenght = -1;//线性表的链式结构的长度/* 创建节点 */NODE* create_node(int num) { NODE* n = (NODE*...原创 2017-02-04 17:28:25 · 337 阅读 · 0 评论 -
循环链表
#include <stdio.h>#include <malloc.h>//循环链表 typedef struct node { int num; node* next;} NODE;NODE* fool;//尾结点 int lenght = -1;//链表的长度 NODE* create_node(int num) { NODE* n = (N...原创 2017-02-05 09:58:01 · 249 阅读 · 0 评论 -
双向链表
#include <stdio.h>#include <malloc.h>//双向链表typedef struct node { //结点 int num; node* prior; /*前驱指针*/ node* next; /*后继指针*/} NODE;NODE* last = NULL; //记录上一个结点指针 /** 创建一...原创 2017-02-06 14:17:15 · 177 阅读 · 0 评论 -
栈
#include <stdio.h>#include <malloc.h>#define ERROR false#define OK true#define MAXSIZE 5typedef int sElemType;typedef struct { sElemType data[MAXSIZE]; int top;} sqStack;//压...原创 2017-02-07 10:55:00 · 177 阅读 · 0 评论 -
两栈共享空间
#include <stdio.h>#include <malloc.h>#include <stdio.h>#define MAXSIZE 10#define ERROR false#define OK truetypedef int sElemType;typedef struct { sElemType data[MAXSIZE];...原创 2017-02-07 11:25:00 · 286 阅读 · 0 评论 -
栈的链式存储结构
#include <stdio.h>#include <malloc.h>typedef int sElemType;typedef struct stackNode { sElemType e; stackNode* next;} StackNode;typedef struct linkStack { StackNode* top; int c...原创 2017-02-07 15:09:31 · 210 阅读 · 0 评论 -
二叉排序树
#include <stdio.h>#include <malloc.h>//排序二叉树typedef struct node { int num; node* left; node* right;} NODE;//创建节点NODE* create_node(int num) { NODE* n = (NODE*) malloc(sizeof(NO...原创 2017-02-23 17:59:01 · 265 阅读 · 0 评论