diff --git a/circularListinsertion b/circularListinsertion
index 49f76ed..2464514 100644
--- a/circularListinsertion
+++ b/circularListinsertion
@@ -2,17 +2,16 @@ struct Node *addToEmpty(struct Node *last, int data)
 {
 	// This function is only for empty list
 	if (last != NULL)
-	return last;
+	 return last;
 
 	// Creating a node dynamically.
-	struct Node *temp =
-		(struct Node*)malloc(sizeof(struct Node));
+	struct Node *temp = (struct Node*)malloc(sizeof(struct Node));
 
 	// Assigning the data.
 	temp -> data = data;
 	last = temp;
-	// Note : list was empty. We link single node
-	// to itself.
+	
+	// Note : list was empty. We link single node to itself.
 	temp -> next = last;
 
 	return last;