栈代码(C)

#include<stdio.h>
#include<stdlib.h>

typedef struct Node{
    int data;
    struct Node* next;
}Node;

typedef struct Stack{
    int size;
    Node* stacktop;
}Stack;
//创建栈
Stack* createstack(){
    Stack* mystack=(Stack*)malloc(sizeof(Stack));
    mystack->size=0;
    mystack->stacktop=NULL;
    return mystack;
}
//创建节点
Node* createnode(int data){
    Node* node=(Node*)malloc(sizeof(Node));
    node->data=data;
    node->next=NULL;
    return node;
}
//入栈
void push(Stack* mystack,int data){
    Node* newnode= createnode(data);
    newnode->next=mystack->stacktop;
    mystack->stacktop=newnode;
    mystack->size++;
}
//获取栈顶元素
int top(Stack* mystack){
    //if(!mystack->stacktop) return -1;
    if(mystack->size==0)  return -1;
    return mystack->stacktop->data;
}
//出栈
void pop(Stack* mystack,int* e){
    if(mystack->size==0){
        printf("栈为空，无法出栈");
        return;
    }
    Node* node=mystack->stacktop;
    mystack->stacktop=node->next;
    *e=node->data;
    free(node);
    mystack->size--;
}
//print
void printstack(Stack* mystack){
    Node*  pmove=mystack->stacktop;
    while(pmove!=NULL){
        printf("%d\t",pmove->data);
        pmove=pmove->next;
    }
    printf("\n");
}

int main(){
    Stack* mystack=createstack();
    for(int i=0;i<=5;i++){
        push(mystack,i);
    }
    printstack(mystack);
    int num;
    pop(mystack,&num);
    printf("%d\n",num);
    printf("%d",top(mystack));
    return 0;
}