PreCourse-1/Exercise_3.java at master · Simranb10/PreCourse-1 · GitHub

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
68
69
//Time Complexity : O(n)
//Space Complexity : O(n)
importjava.io.*;

// Java program to implement
// a Singly Linked List
publicclassExercise_3 {

Nodehead; // head of list

// Linked list Node.
// This inner class is made static
// so that main() can access it
staticclassNode {

intdata;
Nodenext;

// Constructor
Node(intd)
 {
this.data = d;
 }
 }

// Method to insert a new node
publicstaticExercise_3insert(Exercise_3list, intdata)
 {
Nodenode = newNode(data);
if(list.head == null) {
list.head = node;
 } else {
Nodecurrent = list.head;
while(current.next != null) {
current = current.next;
 }
current.next = node;
 }
returnlist;
 }

publicstaticvoidprintList(Exercise_3list)
 {
for(Nodecurrent = list.head; current != null; current = current.next) {
System.out.println(current.data);
 }
 }

// Driver code
publicstaticvoidmain(String[] args)
 {
/* Start with the empty list. */
Exercise_3list = newExercise_3();

//
// ******INSERTION******
//

// Insert the values
list = insert(list, 1);
list = insert(list, 2);
list = insert(list, 3);
list = insert(list, 4);
list = insert(list, 5);

// Print the LinkedList
printList(list);
 }
}