We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Node*insert(Node*head,intdata){Node*myNode=newNode(data);if(head==NULL){returnmyNode;}Node*tmp=head;while(tmp->next!=NULL){tmp=tmp->next;}tmp->next=myNode;returnhead;//Complete this method}
Cookie support is required to access HackerRank
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++