Skip to main content

Circular Link List

Circular Link List is data structure in which all nodes are connected into the continuous circle. In this list, the last node points to the first node of the list. The last node reference is stored in variable and its next node is first node of the list. Before going to discuss the operation on circular link list we will first see the basic structure of the data structure and see how it can be represented in c programming. First we will see the how the node of circular link list is represented. See the image below:

The component of singly list node:
  • info : It contains the actual/satelite information
  • next : This field points to the next node in the list

Here is how the circular link list is represented:


The components of circular link list are:
  • TAIL is pointer points to the last node of the list
  • NODE : Each node have info field and next pointer to point next NODE in the list
  • Last NODE of the list will point to first node of the list

The structure of circular link list node is represented as below:

struct node{
 int info;
 struct node *next;
};
typedef struct node NODE;

The different operations that can be performed on the circular link list are as:
Labels:

Comments

Post a Comment

Popular posts from this blog

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

Postfix Expression Evaluation

With a given Postfix Expression, we will show you how to evaluate a postfix expression using stack.   Algorithm to evaluate postfix expression: In this algorithm, we will use stack to store operands. The step are as follows: Get the Postfix Expression String While the end of Postfix Expression string If the current character is operand Push it into Stack End If If the current character is operator Pop stack for second_operand Pop stack for first_operand Evaluate the expression (first_operand)(operator)(second_operand) and push the result into stack End If End While Pop stack for result and return it       Function to Evaluate Postfix Expression: double evaluate_postfix_exp(char *poststr){ STACK stk; //stack for pushing operands int i = -1; double op1, op2; stk.top = -1; //top of stack while(poststr[++i]){ if(poststr[i] == ' '){ //escape space continue; } if(isdig(poststr[i])){ push( &stk, (double)(poststr[i]-'0')/*char to int...
Post a Comment
Read more