자료구조_c언어_연결링크_linkedStack01

연결링크 예전에 자료구조 공부하며 작성해보았던 코딩입니다. 다시 공부를 하기위해 올리며 복습중입니다.

 

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
typedef int element;
typedef struct stackNode {
    element data;
    struct stackNode *link;
}StackNode;
 
StackNode *top;
 
void push(element item) {
    StackNode *temp = (StackNode*)malloc(sizeof(StackNode));
    temp->data = item;
    temp->link = top;
    top = temp;
}
 
element pop() {
    element item;
    StackNode *temp = top;
    if (top == NULL) {
        printf("\n\n Stack is empty !\n");
        return 0;
    }
    else {
        item = temp->data;
        top = temp->link;
        free(temp);
        return item;
    }
}
 
element peek() {
    element item;
    if (top == NULL) {
        printf("\n\n Stack is empty !\n");
        return 0;
    }
    else {
        item = top->data;
        return item;
    }
}
 
void del() {
    StackNode *temp;
    if (top == NULL) {
        printf("\n\n Stack is empty !\n");
    }
    else {
        temp = top;
        top = top->link;
        free(temp);        // 날리기
    }
}
 
void printStack() {
    StackNode *p = top;
    printf("\n STACK [");
    while (p) {
        printf("%d ", p->data);
        p = p->link;
    }
    printf("]");
}
 
int main() {
    element item;
 
    top = NULL;
    printStack();
    push(1);
    printStack();
    push(2);
    printStack();
    push(3);
    printStack();
 
    item = peek();
    printStack();
    printf("peek top =>%d", item);
 
    del();
    printStack();
 
    item = pop();
    printStack();
    printf("\t pop top =>%d", item);
 
    item = pop();
    printStack();
    printf("\t pop top =>%d", item);
 
    pop();
 
    getchar();
 
    return 0;
}