Not a member of GistPad yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct Node
- {
- int data;
- Node*next;
- };
- // Head pointer
- Node*head=NULL;
- // Function to insert at end
- void insertEnd(int value)
- {
- Node*newNode=new Node();
- newNode->data=value;
- newNode->next=NULL;
- if (head == NULL)
- {
- head = newNode;
- return;
- }
- Node*temp=head;
- while(temp->next!= NULL)
- {
- temp=temp->next;
- }
- temp->next=newNode;
- }
- // Function to display list
- void display()
- {
- Node*temp = head;
- cout<< "Linked List: ";
- while(temp!= NULL)
- {
- cout<<temp->data<"->";
- temp=temp->next;
- cout << "NULL\n";
- }
- int main()
- {
- insertEnd(10);
- insertEnd(20);
- insertEnd(30);
- display();
- return 0;
- }
RAW Paste Data
Copied
