Data-Structure-Algorithm/13circularll.cpp at main · mayurgalhate/Data-Structure-Algorithm · GitHub

History

125 lines (93 loc) · 2.08 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

#include<iostream>

using namespace std;

class Node{

public:

int data;

Node* next;

//constrcutor

Node(int d) {

this->data = d;

this->next = NULL;

}

~Node() {

int value=this->data;

if(this->next!=NULL){

delete next;

next=NULL;

}

cout << " memory is free for node with data " << value << endl;

}

};

void insertNode(Node* &tail, int element, int d) {

//empty list

if(tail == NULL) {

Node* newNode = new Node(d);

tail = newNode;

newNode -> next = newNode;

}

else{

//non-empty list

//assuming that the element is present in the list

Node* curr = tail;

while(curr->data != element) {

curr = curr -> next;

}

//element found -> curr is representing element wala node

Node* temp = new Node(d);

temp -> next = curr -> next;

curr -> next = temp;

}

void print(Node* tail) {

Node* temp = tail;

//empty list

if(tail == NULL) {

cout << "List is Empty "<< endl;

return ;

}

do {

cout << tail -> data << " ";

tail = tail -> next;

} while(tail != temp);

cout << endl;

}

void deleteNode(Node* &tail ,int value){

//for empty CLL

if(tail==NULL){

cout << "empty!" << endl;

}

//non empty CLL

else{

Node* prev=tail;

Node* curr=prev->next;

while(curr->data!=value){

prev=curr;

curr=curr->next;

}

prev->next=curr->next;

//1 Node Linked List

if(curr == prev) {

tail = NULL;

}

//>=2 Node linked list

else if(tail == curr ) {

tail = prev;

}

curr -> next = NULL;

delete curr;

}

int main(){

Node* tail=NULL;

insertNode(tail, 5, 3);

print(tail);

insertNode(tail, 3, 5);

print(tail);

insertNode(tail, 5, 7);

print(tail);

insertNode(tail, 7, 9);

print(tail);

deleteNode(tail, 9);

print(tail);

return 0;

}

Data-Structure-Algorithm/13circularll.cpp at main · mayurgalhate/Data-Structure-Algorithm · GitHub

Expand file tree

Breadcrumbs

13circularll.cpp

Latest commit

History

Breadcrumbs

13circularll.cpp

File metadata and controls