Introduction When dealing with many problems we need a dynamic list, dynamic in the sense […]

## Inserting a node by using recursive programs

A linked list is a recursive data structure. A recursive data structure is a data […]

## Sorting and reversing a linked list

To sort a linked list, first we traverse the list searching for the node with […]

## Deleting the nodes in a singly linked list

To delete a node, first we determine the node number to be deleted (this is […]

## Inserting a node after the specified node in a singly linked list

To insert a new node after the specified node, first we get the number of […]

## Inserting a new node in a sorted List

To insert a new node into an already sorted list, we compare the data value […]

## Counting nodes of a Linked List

Counting the number of nodes of a singly linked list requires maintaining a counter that […]

Erasing a linked list involves traversing the list starting from the first node, freeing the […]

## Polynomial Representation

One of the problems that a linked list can deal with is manipulation of symbolic […]

## Representation of Sparse Matrices

A matrix is a two-dimensional data object made of m rows and n columns, therefore […]

A circular list is a list in which the link field of the last node […]

## Splitting a list with 2n nodes into two separate and equal lists

If the circular linked list has 10 nodes, then the two lists have 5 nodes […]

## Merging of Two Circular Lists

You can merge two lists into one list. The following program merges two circular lists. […]

## Reversing the direction of links in a singly linked circular list

You can reverse the direction of links in the circular list. If you do so, […]