C语言复习--实现栈

C

 #include <stdio.h>
 #include <stdlib.h>
 #define STACK_SIZE 100
 typedef char TYPE;
 typedef struct Node* pNode;
 typedef struct Node node;
 typedef pNode Stack;
 //char buffer[100];
 struct Node
 {
     TYPE data;
     struct Node* next;
 };
 int isEmpty(Stack s);
 void Pop(Stack s);
 void Push(Stack s,TYPE element);
 TYPE Top_of_stack(Stack s);
 Stack CreatStack();
 void makeEmpty(Stack s);

 Stack CreatStack()
 {
     Stack s=(Stack)malloc(sizeof(node));
     s->next=NULL;
     makeEmpty(s);
     return s;
 }
 void makeEmpty(Stack s)
 {
     if(s==NULL)
     printf("you need creat a stack at first");
     while(!isEmpty(s))
     Pop(s);
 }
 int isEmpty(Stack s)
 {
     return s->next==NULL;
 }
 void Pop(Stack s)
 {
     if(isEmpty(s))
       printf("Stack is empty");
     else
     {
         pNode temp=s->next;
         s->next=s->next->next;
         free(temp);
     }

 }
 void Push(Stack s,TYPE element)
 {
     pNode temp=(Stack)malloc(sizeof(node));
     if(temp)
     {
         temp->data=element;
         temp->next=s->next;
         s->next=temp;
     }
 }
 TYPE Top_of_stack(Stack s)
 {
     if(isEmpty(s))
     {
         printf("Stack is empty");
         return ;
     }
     else
     return s->next->data;
 }

 int main()
 {
     Stack s =CreatStack();
     makeEmpty(s);
     Push(s,'c');
     Push(s,'d');
     Push(s,'e');
     while(!isEmpty(s))
     {
         printf("%c",Top_of_stack(s));
         Pop(s);
     }

   return ;
 }

Code