DS_ALGO/insert_at_tail.cpp at master · azutsavv/DS_ALGO · 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>
using namespace std;
class Node{
    public:
    int data;
    Node* next;

};
Node* head;


void Create(int Arr[],int size){
    Node* temp;
    Node* last;

    head = new Node;
    head->data= Arr[0];
    head->next= nullptr;

    last=head;

    // creating linked list

    for(int i=1;i<size;i++ ){
        temp = new Node;

        temp->data=Arr[i];
        temp->next=nullptr;

        last->next=temp;
        last=temp;

    }

}

// insert at tail

void Insert_at_tail(int key){
    Node* last;
    Node* temp = new Node;
    temp->data=key;
    temp->next= NULL;

    if (head==NULL)
    {
        head=last=temp;
    }
    else{
        last->next=temp;
        last=temp;
    }

}

void Display(Node* P){
    while (P!=nullptr)
    {
        cout<<P->data<<"->";
        P=P->next;

    }
}

int main(){
    Insert_at_tail(1);
    Insert_at_tail(2);
    Insert_at_tail(3);
    Insert_at_tail(4);
    Insert_at_tail(5);
    Insert_at_tail(6);
    Display(head);
    return 0;
}