Data-Structure-Cpp/b-14-12.cpp at main · mrabid/Data-Structure-Cpp · GitHub

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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include<iostream>
#include<stdlib.h>
using namespace std;
int main()

class Node{
public:
    int data;
    Node* next;

};

void printList(Node* n)
{
    while(n!=NULL)
    {
        cout<<n->data<<" ";
        n=n->next;
    }
}

{
    Node* head = NULL
    Node* second = NULL
    Node* third = NULL

    head = new Node();
second = new Node();
third = new Node();

head -> data = 1;
head -> next = second;

second -> data = 2;
second -> next = third;

third -> data = 2;
third -> next = NULL;

printList(head);

return 0;

}