Commit 4a14b74

@@ -6,6 +6,12 @@ PriorityQueue *initialize() {
   queue->size = 0;
   return queue;
 }
+Node *create_node(int priority, int data) {
+  Node *node = malloc(sizeof(Node));
+  node->priority = priority;
+  node->data = data;
+  return node;
+}
 
 int count(PriorityQueue *queue) {
   return queue->size;

@@ -1,5 +1,6 @@
 typedef struct {
-
+  int priority;
+  int data;
 } Node;
 
 typedef struct {
@@ -8,5 +9,6 @@ typedef struct {
 
 
 PriorityQueue *initialize();
+Node *create_node(int priority, int data);
 int count(PriorityQueue *queue);
 void add(PriorityQueue *queue, Node *node);

@@ -21,13 +21,12 @@ Ensure(PriorityQueue, returns_size) {
   PriorityQueue *queue = initialize();
 
   assert_that(count(queue), is_equal_to(0));
+  free(queue);
 }
 
 Ensure(PriorityQueue, adds_a_node) {
   PriorityQueue *queue = initialize();
-  Node *node;
-
-  node = malloc(sizeof(Node));
+  Node *node = create_node(1, 0);
 
   add(queue, node);