CPP
cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include<iostream>
using namespace std;
struct Node {
int data;
Node *next;
};
Node *head = NULL;
void insertBeg(int d) {
Node *ptr = new Node();
ptr->data = d;
ptr->next = head;
head = ptr;
}
void printlist(Node *n) {
while (n != NULL) {
cout << n->data << " ";
n = n->next;
}
cout << endl;
}
int main() {
Node *second = NULL;
Node *third = NULL;
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run