数据结构堆栈

/* Stack.h */
#ifndef _Stack_H
#define _Stack_H

struct NodeStack;
typedef struct NodeStack *PtrToNode;
typedef PtrToNode Stack;
typedef char ElementType;

int StackIsEmpty(Stack S);
Stack CreateStack(void);
void DisposeStack(Stack S);
void MakeEmpty(Stack S);
void Push(ElementType X, Stack S);
ElementType Top(Stack S);
void Pop(Stack S);

// Stack implementation is a linked list with a header
struct NodeStack
{
    ElementType Element;
    PtrToNode Next;
};

#endif

/* Stack.cpp */
#include "Stack.h"
#include <stdlib.h>
#include <stdio.h>

int StackIsEmpty(Stack S)
{
    return S->Next == NULL;
}

// 创建一个空栈, 只需创建一个头结点
Stack CreateStack(void)
{
    Stack S;

    S = (struct NodeStack*)malloc(sizeof(struct NodeStack));
    if(S == NULL)
        printf("Fatal Error: Out of space!!");
    S->Next = NULL;
    MakeEmpty(S);
    return S;
}
// 清空栈
void MakeEmpty(Stack S)
{
    if(S == NULL)
        printf("Must use CreateStack first");
    else
        while(!StackIsEmpty(S))
            Pop(S);
}

// Push 操作, 在链表的前端插入
void Push(ElementType X, Stack S)
{
    PtrToNode TmpCell;

    TmpCell = (struct NodeStack*)malloc(sizeof(struct NodeStack));
    if(TmpCell == NULL)
        printf("Fatal Error: Out of space!!");
    else
    {
        TmpCell->Element = X;
        TmpCell->Next = S->Next;
        S->Next = TmpCell;
    }
}

// Top 操作, 返回栈顶元素
ElementType Top(Stack S)
{
    if (!StackIsEmpty(S))
        return S->Next->Element;

    printf("Empty stack\n");
    return 0;
}

// Pop 操作, 通过删除表的前端元素实现
void Pop(Stack S)
{
    PtrToNode FirstCell;

    if(StackIsEmpty(S))
         printf("Empty stack\n");
    else
    {
        FirstCell = S->Next;
        S->Next = FirstCell->Next;
        free(FirstCell);
    }
}

#include <stdio.h>
#include <stdlib.h>
#include "Stack.h"
void main()
{
    // 创建一个堆栈
    Stack stackchar;
    stackchar = CreateStack();
    for (int i=0; i< 5; ++i)
    {
        char cstr = '(';
        Push(cstr+i, stackchar);
    }
    while(!StackIsEmpty(stackchar))
    {
        printf("%c ", Top(stackchar));
        Pop(stackchar);
    }
}

 参考：