Day 15: Linked List

#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* strt = NULL; 
      Node* end =NULL;
    Node *insert(Node *head, int data)
    {
        Node *temp = (Node *)malloc(sizeof(Node));
        temp->next = NULL;
        temp->data = data;
        if (head == NULL)
        {
            head=temp;
            end= head;
        }
        else
        {   
            end->next = temp;
            end = temp;
        }

        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);
		
}