You are viewing a single comment's thread. Return to all comments →
c++
Node* insert(Node *head,int data) { //Complete this method if(head==NULL){ Node* g=new Node(data); return g; } head->next=insert(head->next,data); return head; }
Seems like cookies are disabled on this browser, please enable them to open this website
Day 15: Linked List
You are viewing a single comment's thread. Return to all comments →
c++