dHkQ2E - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;

struct Node{
	int val;
	Node* next;
	Node(int val):next(nullptr),val(val){};
};

Node* removefirst(Node* head){
	if(head == nullptr)return nullptr;
	if(head->next == nullptr){
		delete head;
		return nullptr;
	}

	Node* temp = head->next;
	delete head;

	return temp;
}

Node* LL(vector<int>&a){
	Node* head = new Node(a[0]);
	Node* curr = head;

	for(int i = 1;i<a.size();i++){
		curr->next = new Node(a[i]);
		curr = curr->next;
	}
	return head;
}
void print(Node* head){
	Node* temp = head;

	while(temp!=nullptr){
		cout<<temp->val<<endl;
		temp = temp->next;
	}
}
int main() {
    int n;
    cin>>n;

    vector<int>a(n);
    for(int i = 0 ;i < n ;i++){
    	cin>>a[i];
    }

    Node* head = LL(a);
    Node* temp = removefirst(head);

    print(temp);
	return 0;
}