-
Notifications
You must be signed in to change notification settings - Fork 42
/
Copy pathCircular Linked List
54 lines (47 loc) · 1.31 KB
/
Circular Linked List
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
class Node {
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class CircularLinkedList {
private Node head;
public void append(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
head.next = head; // Point back to itself to form the circular structure
} else {
Node current = head;
while (current.next != head) {
current = current.next;
}
current.next = newNode;
newNode.next = head; // Make the new node point back to the head to complete the circle
}
}
public void display() {
if (head == null) {
System.out.println("The circular linked list is empty.");
return;
}
Node current = head;
do {
System.out.print(current.data + " -> ");
current = current.next;
} while (current != head);
System.out.println();
}
}
public class Main {
public static void main(String[] args) {
CircularLinkedList cll = new CircularLinkedList();
cll.append(1);
cll.append(2);
cll.append(3);
System.out.println("Circular Linked List:");
cll.display();
}
}