随笔分类 - 数据结构c语言实现
学习笔记,有错请指出,谢谢
    
摘要:#include#include#define SIZE 100 //栈的最大长度#define STEPTSIZE 10 //栈每次增长的长度typedef int ElemType;/*栈的定义*/typedef struct stack{ ElemType *base; ElemType *top; int stackSize;}stack;/*栈顶初始化*/void initAStack(stack *s){ s->base =(ElemType *)malloc(SIZE*sizeof(ElemType)); if(s->base =...
        阅读全文
                
摘要:#include#includetypedef char* ElemType;typedef struct StackNode{ ElemType data; struct StackNode *next;}StackNode,*LinkStack;StackNode * initStackHeadNode( LinkStack ls);LinkStack push(LinkStack ls,ElemType e);LinkStack popTop(LinkStack ls);void traverseLinkedStack(StackNode * sn);void main()...
        阅读全文
                
摘要:下图表示顺序栈中数据元素和栈指针之间的对应关系#include#include#define SIZE 100 //栈的最大长度#define STEPTSIZE 10 //栈每次增长的长度typedef char ElemType;/*栈的定义*/typedef struct stack{ ElemType *base; ElemType *top; int stackSize;}stack;/*栈顶初始化*/void initAStack(stack *s){ s->base =(ElemType *)malloc(SIZE*sizeof(Ele...
        阅读全文
                
                    
                
浙公网安备 33010602011771号