Update 2-insert-a-node-at-the-tail-of-a-linked-list.cpp

DataStructure/LinkedLists/2-insert-a-node-at-the-tail-of-a-linked-list.cpp

@@ -1,23 +1,16 @@
 Node* Insert(Node *head, int data)
 {
-    Node *temp = (Node*)malloc(sizeof(struct Node));
-
-    if (temp == NULL) {
-        exit(-1);
-    }
-
-    temp->data = data;
-    temp->next = NULL;
-
-    if (head == NULL) {
-        head = temp;
-    } else {
-        Node* current  = head;
-        while (current->next != NULL) {
-            current = current->next;
-        }
-        current->next = temp;
+    Node *p = new Node(data);
+    Node *q;
+    q = head;
+
+    if(head == NULL)
+        return (p);
+    while(q->next != NULL){
+        q = q->next;
     }
-
+    q->next = p;
     return head;
 }
+
+