| 22 | } |
| 23 | |
| 24 | void push(StackList *list, void *data) { // Insert At First |
| 25 | StackNode* newNode = malloc(sizeof(StackNode)); |
| 26 | newNode->next = NULL; |
| 27 | newNode->data = data; |
| 28 | |
| 29 | if(newNode == NULL) { |
| 30 | return; |
| 31 | } |
| 32 | |
| 33 | if(*list == NULL) { |
| 34 | *list = newNode; |
| 35 | } else { |
| 36 | StackNode *firstNode = *list; |
| 37 | *list = newNode; |
| 38 | (*list)->next = firstNode; |
| 39 | } |
| 40 | } |
| 41 | |
| 42 | void* peek(StackList list) { |
| 43 | if(list == NULL) |