Circular Linked Lists
A linked list in which the last node points to the first node is called a circular linked list. Circular linked lists avoid the use of null references in their nodes. Can be useful for certain algorithms like playing video/audio files repeatedly and ALT + TAB in Windows.
Successor of tail node is the head node. In doublylinked list, predecessor of head node is the tail node. Insertions and deletions into a circular linked list follow the same logic patterns used in a singly linked list except that the last node must always point to the first node. Therefore, when inserting or deleting the last node, in addition to updating the tail pointer, we must also point the link field of the new last node to the first node.
Advantage is that we can start searching from any node of the linked list and get to any other node. No logical head and tail pointers. However, we follow the conventions i.e., first element inserted into the list is given status of head and last element entered is called as a tail.
Some characteristics of Circular Linked list are that the Last node references the first node, every node has a successor, and no node in a circular linked list contains NULL.
Defining a Circular Linked List:
#include <iostream> using namespace std; struct Node{ int data; Node* next; }; Node* NodePtr;
Insert into an empty Circular Linked list
Node *loc = new Node; loc>data = 10; Tail = loc; Tail>next = Tail;
Insert to head of a Circular Linked List
loc>next = Tail>next; Tail>next = loc;
loc>next = Tail>next; Tail>next = loc; Tail = loc;
Cur = Tail; Tail = NULL; delete Cur;
Cur = Tail > next; Tail>next = Cur>next delete Cur;
Prev>next = Tail>next; delete Tail; Tail = Prev;
Example use of Circular Linked list
Ever wonder what to do if the integer size required by your program is greater than 232, 264, 2512, 21024? 4294967296 and greater CANNOT be handled by primitive int data type. What we can do is make use of linked lists. To Add two such long integers, their digits are traversed from right to left. The corresponding digits are added and the possible carry is added to the next digit.
We store the integers from right to left in a list so that the first node contains the least significant digit (rightmost). And the last node contains the most significant digit (leftmost). We keep five digits in each node.
 First let the user input two long integers
 Store the two long integers in the lists
 Both lists are traversed in parallel, and five digits are added at a time
 If the sum of two 5 digits number is x, the lower order 5 digits of x can be extracted by using

x % 100000
 The carry can be computed by integer division

x / 100000
largeInt* addint (largeint *int1, largeint *int2) { Node *p, q; int hunthou = 100000; int carry, number, total; largeint * sum; //defined to contain sum of p and q sum = new largeint; p = int1>Tail>Next; //p and q point to heads of list q = int2>Tail>Next; carry = 0; do { //add info of two nodes and previous carry total = p>data + q>data + carry; //Determine lower order five digits number = total % hunthou; insertRear(sum, number); //determine the carry carry = total / hunthou; p = p >next; q = q>next } while ( p != int1>Tail>Next && q != int2>Tail>Next) while (p != int1>Tail>Next) { total = p>data + carry; number = total % hunthou; insertRear(sum, number); carry = total / hunthou; p = p>next; } while (q != int2>Tail>Next) { total = q>data + carry; number = total % hunthou; insertRear(sum, number); carry = total / hunthou; q = q>next; } if (carry == 1) { insertRear (sum, carry); } return sum; }
Related Posts
 Queue Implementation in C++
 Binary Search Trees and Data Structure
 Bucket Sort (Bin Sort) with Example
 Quick Sort Algorithm with Graphical Explanation
 Heap Sort with Graphical Explanation
 Merge Sort with Graphical explanation
 Graphical Path Finding System using Dijkstra Algorithm
 Applications of Dijkstra Algorithm
 The OpenGL Programming Guide
 Introduction to Recursion in C++
2 Responses to Circular Linked Lists
Leave a Reply Cancel reply
Popular Posts (last 30 days)
 Attendance Management System 726 view(s)
 Applications of Stack in data structures 168 view(s)
 Graph Implementation in C++ 161 view(s)
 JAVA Graphical User Interface (GUI) 156 view(s)
 Circular Linked Lists 131 view(s)
 Advanced Java Tutorial (For Intermediate) 108 view(s)
 Java Lectures 92 view(s)
 UDP Datagram Sockets in Java 78 view(s)
 Sockets and Network Programming in Java 74 view(s)
 Queue Implementation in C++ 64 view(s)
Thanks for the example and source code on a linked list, exactly what I was looking for, very informative!! Check my Coder Forum I have source similar to this, again thank you!
thanks!!!!!!!