forked from super30admin/PreCourse-1
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList.java
More file actions
92 lines (73 loc) · 2.04 KB
/
LinkedList.java
File metadata and controls
92 lines (73 loc) · 2.04 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
import java.io.*;
// Java program to implement
// a Singly Linked List
public class LinkedList {
Node head; // head of list
// Linked list Node.
// This inner class is made static
// so that main() can access it
static class Node {
int data;
Node next;
// Constructor
Node(int d)
{
this.data=d;
this.next=null;//Write your code here
}
}
// Method to insert a new node
public static LinkedList insert(LinkedList list, int data)
{
Node t=new Node(data);
// Create a new node with given data
// If the Linked List is empty,
// then make the new node as head
if(list.head==null)
{
list.head=t;
}
else{
Node temp=list.head;
while(temp.next!=null)
{
temp=temp.next;
}
temp.next=t;
}
return list;
// Else traverse till the last node
// and insert the new_node there
// Insert the new_node at last node
// Return the list by head
}
// Method to print the LinkedList.
public static void printList(LinkedList list)
{
Node cur=list.head;
while(cur!=null)
{ System.out.println(cur.data);
cur=cur.next;
}
// Traverse through the LinkedList
// Print the data at current node
// Go to next node
}
// Driver code
public static void main(String[] args)
{
/* Start with the empty list. */
LinkedList list = new LinkedList();
//
// ******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);
}
}