LinkedList/CircularLL.cpp at main · Shreyansh-code/LinkedList · 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
92
93
94
95
96
97
98
#include<bits/stdc++.h>
#include<iostream>
using namespace std;

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

    Node(int d){
        this->data=d;
        this->next=NULL;
    }
};

void print(Node* &tail){
    Node* temp=tail;
    if(tail==NULL){
        cout<<"empty list"<<endl;
        return;
        }

    do{
        cout<<tail->data<<" ";
        tail=tail->next;
    }
    while(tail !=temp);
    cout<<endl;
}

void insertNode(Node* &tail, int element, int d){
    if(tail==NULL){
        Node* newNode = new Node(d);
        tail=newNode;
        newNode->next=newNode;
    }
    else{
      Node* curr=tail;
      while(curr->data!=element){
          curr=curr->next;
      }
      Node* temp= new Node(d);
      temp->next=curr->next;
      curr->next=temp;
    }
}

void deletion(Node* &tail, int element){

    if(tail==NULL){
        cout<<"empty list"<<endl;
        return;
        }
    else{
    Node* prev = tail;
    Node* curr=prev->next;
    while(curr->data!=element){
          prev=curr;
          curr=curr->next;
      }
      prev->next=curr->next;
      //list=1 element
      if(curr=prev){
          tail=NULL;
      }

      // list>=2 elements
      else if(tail==curr){
          tail=prev;
      }
      curr->next=NULL;
    }
}

int main(){
    Node* tail=NULL;
    insertNode(tail, 5, 3);
    print(tail);

    insertNode(tail, 3, 5);
    print(tail);

    insertNode(tail, 5, 8);
    print(tail);

    insertNode(tail, 5, 13);
    print(tail);

    deletion(tail, 5);
    print(tail);

    deletion(tail, 3);
    print(tail);

    deletion(tail, 13);
    print(tail);
    return 0;
}