stack.c

@@ -10,43 +10,24 @@
 // Pushes data as pointer onto the stack.
 StackNode *push(StackNode *stack, void *data)
 {
-StackNode *newNode = (StackNode *)malloc(sizeof(StackNode));
+
-if(newNode == NULL)
-  return NULL;
-newNode->data = data;
-newNode->next = stack;
-return newNode;
 }
 
 // Deletes the top element of the stack (latest added element) and releases its memory. (Pointer to data has to be
 // freed by caller.)
 StackNode *pop(StackNode *stack)
 {
-    if (stack == NULL)
-        return NULL;
 
-    StackNode *next = stack->next;
-    free(stack);
-    return next;
 }
 
 // Returns the data of the top element.
 void *top(StackNode *stack)
 {
-if (stack == NULL)
+
-  return NULL;
-return stack->data;
 }
 
 // Clears stack and releases all memory.
 void clearStack(StackNode *stack)
 {
-StackNode *current = stack;
 
-while (current != NULL)
-  {
-  StackNode *next = current->next;
-  free(current);
-  current = next;
-  }
 }

stack.h

@@ -10,10 +10,12 @@ The latest element is taken from the stack. */
 //TODO: passenden Datentyp als struct anlegen
 
 
-typedef struct StackNode {
+typedef struct Node{
-    void *data;
+  int *data;
-    struct StackNode *next;
+  struct Node *next;
-} StackNode;
+
+  } StackNode;
+
 
 // Pushes data as pointer onto the stack.
 StackNode *push(StackNode *stack, void *data);