linkedLists.cpp

#include <iostream>
#include <cstddef>
using namespace std;	
class Node
{
    public:
        int data;
        Node *next;
        Node(int d){
            data=d;
            next=NULL;
        }
};
class Solution{
    public:
      Node* insert(Node *head,int data)
        {
            Node *tmpNode;
          
            Node * lastNode = new Node(data);
            if (head == NULL){
                head = lastNode; // points to the head of the list after an intial empty
            } else {
                tmpNode = new Node(data);
                tmpNode = head;
                while (tmpNode->next != NULL) {
                    tmpNode = tmpNode->next;
                }
                tmpNode->next = lastNode;
            } 
          
            return head;
        }
        
      void display(Node *head)
      {
          Node *start=head;
          while(start)
          {
              cout<<start->data<<" ";
              start=start->next;
          }
      }
};

int main()
{
	Node* head=NULL;
  Solution mylist;
   int T,data;
    
   cin>>T;
   while(T-->0){
       cin>>data;
       head=mylist.insert(head,data);
   }	
   
	mylist.display(head);
		
}