Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void makestack(stos* top) {
- *top = NULL;
- }
- int ifemptystack(stos* top) {
- if (*top == NULL) {
- return 0;
- }
- else
- return 1;
- }
- int push(int data, stos* top) {
- stos ptr;
- ptr = (stos)malloc(sizeof(struct stack));
- if (ptr == NULL) {
- printf("Blad pamieci przy alokacji elementu stosu! ");
- return -1;
- }
- ptr->dane = data;
- ptr->next = *top;
- //Nowy element na gore stosu
- *top = ptr;
- return 0;
- }
- int pop(stos* top) {
- if (ifemptystack == 0) {
- printf("Stos jest pusty!");
- return 1;
- }
- else {
- stos ptr;
- int data;
- ptr = *top;
- data = ptr->dane;
- //Przedostatni na stos
- *top = ptr->next;
- free(ptr);
- return(data);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement