-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.java
67 lines (53 loc) · 1.79 KB
/
LinkedList.java
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
55
56
57
58
59
60
61
62
63
64
65
66
67
// Certainly! Here's an example of a basic implementation of a singly linked list in Java:
// ```java
import java.util.Queue;
class Node {
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class LinkedList implements Queue<Integer> {
Node head;
public LinkedList() {
this.head = null;
}
// Method to insert a new node at the end of the linked list
public void insert(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
} else {
Node current = head;
while (current.next != null) {
current = current.next;
}
current.next = newNode;
}
}
// Method to display the linked list
public void display() {
Node current = head;
while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public static void main(String[] args) {
LinkedList list = new LinkedList();
// Inserting elements into the linked list
list.insert(1);
list.insert(2);
list.insert(3);
list.insert(4);
// Displaying the linked list
System.out.println("Linked List:");
list.display();
}
}
// ```
// This code defines a `Node` class to represent each element in the linked list and a `LinkedList` class to manage the list. The `insert` method adds elements to the end of the list, and the `display` method prints the elements in the list.
// You can run this code and modify it as needed to perform other operations like deletion, insertion at a specific position, or any other functionality you require in a linked list.