## Q. Program to search an element in a circular linked list.

### Explanation

In this program, we create a circular linked list and search a node in the list.

9->5->2->7->3

Consider, above example. Suppose we need to search for node 5. To solve this problem, we will iterate through the list and compare each node with 5. If match is found, we will set the flag to true and prints out the position of the node 5. In this example, node 5 is present at the position 2.

### Algorithm

1. 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.
2. Define another class for creating circular linked list and it has two nodes: head and tail.
3. search() will search for a node in the list:
1. Variable i will keep track of the position of the searched node.
2. Variable flag will store boolean value false.
3. Current will point to head node.
4. Iterate through the loop by incrementing current to current.next and i to i + 1.
5. Compare each node's data with searched node. If match is found, set flag to true.
6. If flag is true, prints the position of searched node.
7. Else, print the message "Element is not present in the list".

## Solution

### Python

Output:

```Element is present in the list at the position : 2
Element is not present in the list
```

### C

Output:

```Element is present in the list at the position : 2
Element is not present in the list
```

### JAVA

Output:

```Element is present in the list at the position : 2
Element is not present in the list
```

### C#

Output:

```Element is present in the list at the position : 2
Element is not present in the list
```

### PHP

Output:

```Element is present in the list at the position : 2
Element is not present in the list
```

Next Topic#