WIP insertion AddNode

main.c

@@ -111,34 +111,50 @@ int ListLength(node *start) {
 }
 
 void AddNode(node **ptr_to_start,int value) {
-  
+   
   node *temp = *ptr_to_start; 
+  node *new_node = NewNode(value);
   node *before;
   node *after;
-
-  if (temp == NULL) {
-    AddNodeToStartOfList(ptr_to_start,value);
+  
+  if (*ptr_to_start == NULL) { // special case if the list is empty 
+    *ptr_to_start = new_node;
+    return;
   }
-  else {
-    while (temp !=NULL) {
-      if (temp->val > value && temp->val < temp->next->val){
-        before = temp;
-        after = temp->next;
-
-        temp = NewNode(value);
-        before->next = temp;
-        temp->next = after;
-      }
-      else if (temp->next == NULL){
-        AddNodeToEndOfList(ptr_to_start,value);
-      }
-      
-      else {
-        temp = temp->next;
-      }
+
+
+  while (temp->next != NULL && temp->next->val < value) {
+
+    if (ptr_to_start == temp) {
+      AddNodeToStartOfList(value);
+      return;
+     }
+
+    else {
+    temp = temp->next;
     }
-  }
-}
+    
+  } 
+  NewNode(value);
+  temp->next = 
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
 
 /* Exercise Tasks
 1. Write a function int ListLength(*start) which traverses the list, counts the number of nodes and returns that count.