Hackerrank | 30 days of code | Day 15-Solution in c++| Linked-List-hackerrank-Solution-in-c++

Hackerrank | 30 days of code | Day 15-Solution in c++| Linked-List-hackerrank-Solution-in-c++

https://www.hackerrank.com/challenges/30-Linked-List/problem

Day 15 Linked List Solution in 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)
      {
         if(head == NULL){
              head = new Node(data);
              return head;
          }
          else if(head->next == NULL){
              Node *temp = new Node(data);
              head->next = temp;
              return head;
          }
          else{
              insert(head->next, data);
          }
          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);
		
}