Advertisement
Guest User

Untitled

a guest
Nov 22nd, 2017
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. void makestack(stos* top) {
  2. *top = NULL;
  3. }
  4. int ifemptystack(stos* top) {
  5. if (*top == NULL) {
  6. return 0;
  7. }
  8. else
  9. return 1;
  10. }
  11. int push(int data, stos* top) {
  12. stos ptr;
  13.  
  14. ptr = (stos)malloc(sizeof(struct stack));
  15.  
  16. if (ptr == NULL) {
  17. printf("Blad pamieci przy alokacji elementu stosu! ");
  18. return -1;
  19. }
  20.  
  21. ptr->dane = data;
  22. ptr->next = *top;
  23.  
  24. //Nowy element na gore stosu
  25. *top = ptr;
  26. return 0;
  27. }
  28.  
  29. int pop(stos* top) {
  30. if (ifemptystack == 0) {
  31. printf("Stos jest pusty!");
  32. return 1;
  33. }
  34. else {
  35. stos ptr;
  36. int data;
  37. ptr = *top;
  38. data = ptr->dane;
  39.  
  40. //Przedostatni na stos
  41. *top = ptr->next;
  42. free(ptr);
  43.  
  44. return(data);
  45. }
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement