addnode end
DESCRIPTION
Linked ListTRANSCRIPT
Untitled
#include using namespace std;
struct Node{ int info; Node *next;};
void initNode(struct Node *head, int n){ head->info = n; head->next =NULL;}
void addNode_end(struct Node *head, int n){ Node *new_node = new Node; new_node->info = n; new_node->next = NULL; Node *temp = head; while (temp != NULL) { if (temp->next == NULL) { temp->next = new_node; return; } else temp = temp->next; }}
void display(struct Node *head){ Node *temp = head; cout info = n; new_node->next = NULL; NODE *temp = head; while (temp != NULL) { if (temp->next == NULL) { temp->next = new_node; return; } temp = temp->next; }}
void display(NODE *head){ NODE *temp; temp = head; cout