Merge pull request #175 from kiruba-r11/feature-1

Added Iterative Reverse in Circular Linked Lists

Author: smv1999

Data Structures/Linked Lists/Circular Linked Lists/reverse.cpp

@@ -0,0 +1,116 @@
+/*
+
+This is a Circular Linked List program which reverses the Linked List iteratively.
+
+Since, it is a Circular Linked List, the last node would point to the head node.
+
+*/
+
+#include <iostream>
+
+using namespace std;
+
+/*
+
+Node definition:
+	1. Integer Data
+	2. Pointer to next node.
+
+*/
+
+class cll_node {
+public: 
+	int data;
+	cll_node* next;
+};
+
+void createCLL(cll_node* &head) {
+
+	int choice;
+
+	cll_node* temp = head;
+
+	do {
+		int data;
+
+		cout << "Enter Data : ";
+		cin >> data;
+
+		cll_node* newNode = new cll_node();
+		newNode->data = data;
+		newNode->next = NULL;
+
+		if(head == NULL) {
+			head = newNode;
+			newNode->next = head;
+			temp = head;
+		} else {
+			temp->next = newNode;
+			temp = newNode;
+			temp->next = head;
+		}
+
+		cout << "Do you want to continue? (1/0) : ";
+		cin >> choice;
+
+	} while(choice == 1);
+
+}
+
+void reverse_it(cll_node* &head , cll_node* p) {
+
+	cll_node *q = head , *r = head->next;
+
+	while(r != head) {
+		q->next = p;
+		p = q;
+		q = r;
+		r = r->next;
+	}
+	q->next = p;
+	head = q;
+
+}
+
+void reverse(cll_node* &head) {
+	if(head == NULL || head->next == head)
+		return;
+
+	cll_node* temp = head;
+	while(temp->next != head) {
+		temp = temp->next;
+	}
+
+	reverse_it(head , temp);
+
+}
+
+void display(cll_node* head) {
+	cout << "The elements are : ";
+	if(head == NULL)
+		return;
+	cll_node* temp = head;
+
+	do {
+		cout << temp->data << " ";
+		temp = temp->next;
+	} while(temp != head);
+	cout << endl;
+}
+
+int main() {
+
+	cll_node* head = NULL;
+
+	createCLL(head);
+
+	cout << "Before Reversing : " << endl;
+	display(head);
+
+	reverse(head);
+
+	cout << "After Reversing : " << endl;
+	display(head);
+
+	return 0;
+}