You are viewing a single comment's thread. Return to all comments →
try in c++
typedef struct Node *list; list Insert(list head,int data) { if(head==NULL){ head = new Node; head->next=NULL; head->data=data; return head; } return Insert(head->next,data); }
In C++ the typedef is implicit so you don't need it
Wrong Answer! Some possible errors: 1. You returned a NULL value from the function. 2. There is a problem with your logic
No way to return the start pointer
Insert a Node at the Tail of a Linked List
You are viewing a single comment's thread. Return to all comments →
try in c++
typedef struct Node *list; list Insert(list head,int data) { if(head==NULL){ head = new Node; head->next=NULL; head->data=data; return head; } return Insert(head->next,data); }
In C++ the typedef is implicit so you don't need it
Wrong Answer! Some possible errors: 1. You returned a NULL value from the function. 2. There is a problem with your logic
No way to return the start pointer