CodingClubIndia/AddTail.cpp at master · Shivanii28/CodingClubIndia · 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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include<iostream>
#include<bits/stdc++.h>
using namespace std;

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

        node(int val){
            data=val;
            next=NULL;
        }
};
boolean search(node* &head,int key)
{
    node* temp=head;
    while(temp->data!=key)
    {
        temp=temp->next;
    }
    if(temp->next==NULL)
    return false;
    else
    return true;
}
void insertAt_Head(node* &head,int val)
{
    node* n=new node(val);
    n->next=head;
    head=n;
}

//insert element at the end of linked list
void tail(node* &head, int val){

    node* n=new node(val);
    if(head==NULL){
        head=n;
        return;
    }
    node* temp=head;

    while(temp->next!=NULL){
        temp=temp->next;
    }
    temp->next=n;


}

//deletion function
void deletion(node* &head, int val)
{
    node* temp=head;
    while(temp->next->data!=val){
        temp=temp->next;
    }
    node* todelete=temp->next;
    temp->next=temp->next->next;

    delete todelete;
}


//display all element present in the linked list
void display(node* head){
    node* temp=head;
    while(temp!=NULL){
        cout<<temp->data<<" -> ";
        temp=temp->next;

    }
    cout<<"NULL";
    cout<<endl;
}
int main(){
    node* head=NULL;
    tail(head,1);
    tail(head,2);
    tail(head,3);
    display(head);
    deletion(head,3);
    insertAt_Head(head,0);
    insertAt_Head(head,-1);
    insertAt_Head(head,-2);
    search(head ,0);
    display(head);

    return 0;
}