Programs

Q. Program to insert a new node at the beginning of the circular linked list.

Explanation

In this program, we will create a circular linked list and insert every new node at the beginning of the list. If the list is empty, then head and tail will point to the newly added node. If the list is not empty, then we will store the data of the head into a temporary node temp and make new node as the head. This new head will point to the temporary node. In simple words, the newly added node will be the first node(head) and previous head(temp) will become the second node of the list.

After inserting new node to the beginning of the list

New represents the newly added node. Earlier A was the head of the list. When new is added to the beginning of the list, new will become the new head, and it will point to the previous head, i.e., A.

Algorithm

Define a Node class which represents a node in the list. It has two properties data and next which will point to the next node.

Define another class for creating the circular linked list and it has two nodes: head and tail. It has two methods: addAtStart() and display() .

addAtStart() will add the node to the beginning of the list:

It first checks whether the head is null (empty list), then it will insert the node as the head.

Both head and tail will point to newly added node.

If the list is not empty, then the newly added node will become the new head, and it will point to previous head.

display() will show all the nodes present in the list.

Define a new node 'current' that will point to the head.

Print current.data till current will points to head again.

Current will point to the next node in the list in each iteration.

Solution

Python

Output:

Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1

C

Output:

Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1

JAVA

Output:

Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1

C#

Output:

Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1

PHP

Output:

Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1