add delete_list, separate print_node and print_node_at

add delete_list()
separate print_node(NODE* head), which prints the data of head, and
  print_node_at(NODE* head, int pos), which traverses head to index pos, then
  prints that node

llist.c

@@ -2,7 +2,7 @@
 #include<stdlib.h>
 #include "llist.h"
 
-void print_node(NODE *head, int pos){
+void print_node_at(NODE *head, int pos){
 	NODE *currentNode;
 
 	currentNode = head;
@@ -13,9 +13,11 @@ void print_node(NODE *head, int pos){
 	printf("The data at index %d is: %d", pos, currentNode->data);
 }
 
+void print_node(NODE *head){
+	printf("%d\n", head->data);}
 
 void print_list(NODE *head){
-	printf("Printing list...\n");
+//	printf("Printing list...\n");
 
 	NODE *currentNode;
 	currentNode = head;
@@ -87,6 +89,14 @@ int delete_node_after(NODE *head){
 	return 0;
 }
 
+void delete_list(NODE *head){
+	if(head == NULL)
+		return;
+	NODE *tmp = head->next;
+	free(head);
+	delete_list(tmp);
+}
+
 NODE *construct_list(datatype list[], int size){
 	if(size<=0)
 		return NULL;

llist.h

@@ -12,13 +12,17 @@ typedef struct Node_Err
   int err;
 }NODE_ERR;
 
-void print_node(NODE *head, int pos);
+void print_node_at(NODE *head, int pos);
 void print_list(NODE *head);
+void print_node(NODE *head);
 NODE_ERR psearch(NODE *head, datatype data);
 NODE_ERR search(NODE *head, datatype data);
 NODE *construct(datatype data, NODE *next);
 NODE *traverse(NODE *head, int pos);
 int delete_node_after(NODE *head);
+void delete_list(NODE *head);
+//int delete_node_at(NODE *head, int pos);
+//int delete_node(NODE *head, datatype data);
 NODE *construct_list(datatype list[], int size);
 int add_to_end(NODE *head, datatype new_data);
 int insert_node(NODE *head, int pos, datatype new_data);

test.c

@@ -3,15 +3,20 @@
 #include "llist.h"
 
 int main(){
-	NODE *two = construct(2, NULL);
+	NODE *two = construct(5, NULL);
 	NODE *one = construct(1, two);
-	NODE *root = construct(0, one);
+	NODE *root = construct(3, one);
 
 	print_list(root);
-	NODE *target = search(root, 2);
-	print_node(target);
+	printf("Searching for 5...\n");
+	NODE_ERR target = search(root, 5);
+	printf("I found it at index %d\n", target.err);
+	printf("The number I found there was ");
+	print_node(target.node);
+	printf("Deleting list...\n");
 	delete_list(root);
+	printf("Now it is garbage:\n");
 	print_list(root);
 
-	return 1;
+	return 0;
 }