C Linked List Traversal and Search: A Detailed Explanation

/'///'void traverse(Node* head) {//n if (head == NULL) {//n printf(///'List is empty.//n///');//n return;//n }//n//n Node* current = head;//n do {//n printf(///'%d ///', current->data);//n current = current->next;//n } while (current != head);//n printf(///'//n///');//n}//n//nNode* search(Node* head, int data) {//n if (head == NULL) {//n printf(///'List is empty.//n///');//n return NULL;//n }//n//n Node* current = head;//n do {//n if (current->data == data) {//n return current;//n }//n current = current->next;//n } while (current != head);//n//n printf(///'Element %d not found in the list.//n////', data);//n return NULL;//n}/