Ended the memory leak

Q1.c

@@ -22,11 +22,6 @@ Student *create_student(int id, char *name, double grades) {
 // Insert student at end of the list
 Student* insert_student(Student *head, int id, char *name, double grades) {
     Student *new_student = create_student(id, name, grades);
-	if(new_student == NULL) {
-		printf("Creation of Student failed\n");
-		return new_student;
-	}
-
 
     // If the list is empty, the new student we are inserting becomes the start
     if(head == NULL) {
@@ -53,7 +48,7 @@ void print_students(Student *head) {
 }
 
 Student* find_highest(Student *head) {
-	if(head == NULL) { return NULL; } // Just exit if the list doesnt exist
+    if(head == NULL) { return NULL; } // Just exit if the list doesn't exist
 
     Student *highest = head;
     Student *temp = head;
@@ -67,6 +62,16 @@ Student* find_highest(Student *head) {
     return highest;
 }
 
+// To end the memory leaks
+void free_student(Student *head) {
+    Student *temp;
+    while(head != NULL) {
+        temp = head;
+        head = head->next;
+        free(temp);
+    }
+}
+
 
 int main() {
     Student *head = NULL; // Initialize the start of the linked list
@@ -80,6 +85,7 @@ int main() {
     Student *highest_student = find_highest(head);
     printf("The highest student is %s, with a grade of: %0.02f", highest_student->name, highest_student->grades);
 
+    free_student(head);
 
     return 0;
 }