You are on page 1of 6

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: 1 #include <iostream> 2using namespace std; 3struct Node{ int data; 4 Node* next; 5 }; 6Node* NodePtr; 7

Insert into an empty Circular Linked list 1Node *loc = new Node; 2loc->data = 10; 3Tail = loc; 4Tail->next = Tail;

## Insert to head of a Circular Linked List 1loc->next = Tail->next; 2Tail->next = loc;

Insert to end of a Circular Linked List 1loc->next = Tail->next; 2Tail->next = loc; 3Tail = loc;

Delete a node from a single-node Circular Linked List 1Cur = Tail; 2Tail = NULL; 3delete Cur;

Delete the head node from a Circular Linked List 1Cur = Tail -> next; 2Tail->next = Cur->next 3delete Cur;

Delete the end node from a Circular Linked List 1Prev->next = Tail->next; 2delete Tail; 3Tail = 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.

Algorithm

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
o x % 100000 x / 100000

## The carry can be computed by integer division

o

1 2 largeInt* addint (largeint *int1, largeint *int2) { 3 Node *p, q; 4 int hunthou = 100000; int carry, number, total; 5 largeint * sum; //defined to contain sum of p and q 6 sum = new largeint; 7 p = int1->Tail->Next; //p and q point to heads of list 8 q = int2->Tail->Next; 9 carry = 0; 10do 11{ //add info of two nodes and previous carry 12 total = p->data + q->data + carry; 13 //Determine lower order five digits 14 number = total % hunthou; 15 insertRear(sum, number); 16 //determine the carry carry = total / hunthou; 17 p = p ->next; 18 q = q->next 19} while ( p != int1->Tail->Next && q != int2->Tail->Next) 20 21while (p != int1->Tail->Next) { 22 total = p->data + carry; 23 number = total % hunthou; 24 insertRear(sum, number); 25 carry = total / hunthou; 26 p = p->next; } 27 28while (q != int2->Tail->Next) 29{ 30 total = q->data + carry; 31 number = total % hunthou; number); 32 insertRear(sum, carry = total / hunthou; 33 q = q->next; 34} 35 36if (carry == 1) 37{ insertRear (sum, carry); 38} 39 40return sum; 41} 42

43 44 45 46 47 48

Related Posts

The OpenGL Programming Guide Introduction to Recursion in C++ Functions with parameters in C++ Functions in C++ Repetition Control Statements in C++ C++ Expressions and Language Constructs Introduction to C++ Basics Mobile Developers Guide to the Parallel Universe Silverlight for Windows Phone Object-oriented Programming in C# for C and Java programmers