3.2链栈

3.2链栈

栈的链式存储结构

链栈的结点声明
typedef char ElemType;
typedef struct node {
    ElemType data;
    struct node *next;
}LinkStack;

栈空条件：top == NULL
栈满条件：不考虑
元素x进栈操作：创建存放元素x的结点p，将其插入到栈顶位置上
出栈元素x操作：置x为栈顶结点的data域，并删除该节点

//初始化栈算法
void IniStack(LinkStack *&top) {
    top = NULL;
}

//销毁栈算法
void DestroyStack(LinkStack *&top) {
    LinkStack *pre = top, *p;
    if(pre == NULL) return;//考虑空栈的情况
    p = pre->next;
    while(p != NULL) {
        free(pre); //释放pre结点
        pre = p;
        p = p->next; //pre、p同步后移
    }
    free(pre); //释放尾结点
}

//进栈算法
int Push(LinkStack *&top,ElemType x) {
    LinkStack *p;
    P = (LinkStack *)malloc(sizeof(LinkStack));
    p->data = x;//创建结点p用于存放x
    p->next = top;//插入p结点作为栈顶结点
    top = p;
    return 1;
}

//出栈算法
int Pop(LinkStack *&top,ElemType &x) {
    LinkStack *p;
    if(top == NULL)//栈空，下溢出返回0
        return 0;
    else { //栈不空时出栈元素x并返回1
        p = top;//p指向栈顶结点
        x = p->data;//取栈顶元素x
        top = p->next;//删除结点p
        free(p);//释放p结点
        return 1;
    }
}

//取栈顶元素算法
int GetTop(LinkStack *top,ElemType &x) {
    if(top == NULL) //栈空，下溢出时返回0
        return 0;
    else {//栈不空，取栈顶元素x并返回1
        x = top->data;
        return 1;
    }
}

//判断栈空算法
int StackEmpty(LinkStack *top) {
    if(top == NULL)
        return 1;
    else
        return 0;
}

只有表头指针没有表尾指针的循环单链表    //入栈操作q = first;while(q->next != first)    q = q->next;//查找尾结点qp = (LinkStack *)malloc(sizeof(LinkStack));p->data = x;p->next = first;first = p;q->next = first; //改为循环单链表//出栈操作q = first;while(q->next != first)     q = q->next;//查找尾结点p = first;x = p->data;first = first->next;q->next = first;//改为循环单链表free(p);