C语言栈的链式存储结构

#include 
#include 
#define MAX_SIZE 40

typedef struct Linknode{
    struct Linknode *next;
}LinkNodes;

typedef struct Stack{
    LinkNodes *Stack_Head;
    int Size;
}LinkStack;

typedef struct node
{
    LinkNodes Stack_node;
    int id;
    int age;
    char name[20];
}nodes;


typedef void* SStack;

SStack Stack_Init();
void Stack_Push(SStack Seq_head, SStack value_in);
void Stack_Pop(SStack);
void Stack_Top(SStack Seq_Head, void (*My_printf)(void*));
void my_printf1(void* node_in);
void Len_stack(SStack Seq_head);
int Is_empty(SStack Seq_head);
void Destroy_stack(SStack Seq_head);

int main() {
    
    nodes n1 = {NULL, 1, 21, "花木兰"};
    nodes n2 = {NULL, 2, 21, "凯皇"};
    nodes n3 = {NULL, 3, 21, "百里守约"};
    nodes n4 = {NULL, 4, 19, "百里玄策"};
    nodes n5 = {NULL, 5, 22, "苏烈"};
    nodes n6 = {NULL, 6, 20, "李信"};

    printf("---开始创建栈---\n");
    SStack Stack_head = Stack_Init();
    printf("---栈创建完毕---\n");
    
    printf("---开始入栈--\n");
    Stack_Push(Stack_head, &n1);
    Stack_Top(Stack_head, my_printf1);
    Stack_Push(Stack_head, &n2);
    Stack_Top(Stack_head, my_printf1);
    Stack_Push(Stack_head, &n3);
    Stack_Top(Stack_head, my_printf1);
    Stack_Push(Stack_head, &n4);
    Stack_Top(Stack_head, my_printf1);
    Stack_Push(Stack_head, &n5);
    Stack_Top(Stack_head, my_printf1);
    Stack_Push(Stack_head, &n6);
    Stack_Top(Stack_head, my_printf1);
    printf("---入栈完毕---\n");
    Len_stack(Stack_head);


    printf("---开始出栈-\n");
    while(!Is_empty(Stack_head)) {
        Stack_Top(Stack_head, my_printf1);
        Stack_Pop(Stack_head);
    }
    printf("---出栈完毕---\n");
    Len_stack(Stack_head);


    printf("---开始销毁栈---\n");
    Destroy_stack(Stack_head);
    Stack_head = NULL;
    printf("---销毁栈完毕---\n");

    system("pause");
    return 0;
}

SStack Stack_Init() {
    LinkStack* My_Stack = (LinkStack*)malloc(sizeof(LinkStack));
    LinkNodes* node_head = (LinkNodes*)malloc(sizeof(LinkNodes));
    if(My_Stack == NULL || node_head == NULL)
        return NULL;
    My_Stack -> Stack_Head =  node_head;
    My_Stack -> Stack_Head -> next = NULL;
    My_Stack -> Size = 0;
    return My_Stack;
}

void Stack_Push(SStack Seq_Head, SStack value_in) {
    if(Seq_Head == NULL)
        return;
    LinkStack* My_Stack = (LinkStack*)Seq_Head;
    if(My_Stack -> Size >= MAX_SIZE)
        return;
    LinkNodes* new_node = (LinkNodes*) value_in;
    new_node -> next = My_Stack -> Stack_Head -> next;
    My_Stack -> Stack_Head -> next = new_node;
    My_Stack -> Size ++;
}

void Stack_Pop(SStack Seq_Head) {
    if(Seq_Head == NULL)
        return;
    LinkStack* My_stack = (LinkStack*)Seq_Head;
    My_stack -> Stack_Head -> next = My_stack -> Stack_Head -> next -> next;
    My_stack -> Size --;
}

void Stack_Top(SStack Seq_Head, void (*My_printf)(void*)) {
    if(Seq_Head == NULL)
        return;
    LinkStack* My_stack = (LinkStack*)Seq_Head;
    if(My_stack -> Size == 0)
        return;
    My_printf(My_stack -> Stack_Head -> next);
}

void my_printf1(void* node_in) {
    nodes* p_node = (nodes*)node_in;
    printf("ID:%d 年龄：%d 名字：%s\n", p_node -> id, p_node -> age, p_node -> name);
}

void Len_stack(SStack Seq_Head) {
    if(Seq_Head == NULL)
        return;
    LinkStack *My_stack = (LinkStack*) Seq_Head;
    printf("栈的长度大小为：%d\n", My_stack -> Size);
}

int Is_empty(SStack Seq_head) {
    LinkStack* My_stack = (LinkStack*) Seq_head;
    if(My_stack -> Size == 0)
        return 1;
    else
        return 0;
}

void Destroy_stack(SStack Seq_Head) {
    if(Seq_Head == NULL)
        return;
    LinkStack *My_stack = (LinkStack*) Seq_Head;
    free(My_stack -> Stack_Head);
    free(My_stack);
    My_stack = NULL;
}