C Language

In this article, we will learn how to search an element in a linked-list. It is a very simple program that is generally asked in the interview. For example: Linked List: 13–>19–>20–>22–>11–>NULL Enter Element: 20 Result: Element Found Linked List: 14–>22–>10–>2–>7–>NULL Enter Element: 3 Result: Element Not Found   Here we will see two methods

In this article, we will learn, how to calculate the length of a linked list using the iterative and recursive method. Iterative method An iterative method is the simplest way to calculate the length of the linked list. In the iterative method, we simply take a counter whose initial value is zero. Now we will

In this article, I will discuss how to rotate a linked list by its n node. That means if an existing linked list is 1->2->3->4->5 and a user-entered 2 then the linked list should be modified to 3->4->5->1->2. Note: The value of n should be less than the length of the linked-list. Steps to rotate

In C language, we can also create a generic linked list using the void pointer. Generic linked list means that it can store any data type as per the requirements. The most important thing about the void pointer, it can store the address of any data type. Means that the programmer can store the address

Like C++, in C language we cannot create a member function in the structure but with the help of a pointer to a function, we can provide the facility to the user to store the address of the function. A user can use this structure to store the address of a function using the function

In this article, we will see how to reverse a linked list in C. For Example, Input : 10->20->30->NULL Output : 30->20->10->NULL   We can reverse the linked list using two approaches. Iterative method Recursive method Iterative method This is the simplest way to reverse  linked list, in which we iterate a loop throughout the linked list

In my previous article, I have discussed the introduction of linked list and linked list insertion. In this article, we will see how to delete a node from the existing linked list. Delete a Node: There are three ways to delete a node from the linked list. It depends on the user requirements. Delete a

In my previous article, I have discussed the basic concept of the linked list and discuss its advantage and disadvantage. In this article, I will discuss how to insert a new node in an existing linked list. Previously I have described an example where I have created a linked list of four nodes. This is

A linked list is an example of a linear data structure. It is stored the data dynamically using the structure and pointers. Linked-list enables the user to store the desired data to create a new location in the program at run time. In simple word, we can say that linked list is a sequence of