forked from srishilesh/Data-Structure-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpractice_ll.java
51 lines (50 loc) · 1.11 KB
/
practice_ll.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
import java.io.*;
public class LinkedList {
Node head;
static class Node{
int data;
Node next;
Node(int d){
data = d;
next = null;
}
}
public static LinkedList insert(LinkedList list,int data)
{
Node new_node = new Node(data);
new_node.next = null;
if(list.head == null)
{
list.head = new_node;
}
else
{
Node last = list.head;
while(last.next!=null)
{
last = last.next;
}
last.next = new_node;
}
return list;
}
public static void printList(LinkedList list)
{
Node curNode = list.head;
System.out.println("Linked List is ");
while(curNode!=null)
{
System.out.print(curNode.data+" -> ");
curNode = curNode.next;
}
}
public static void main(String args[])
{
LinkedList list = new LinkedList();
for(int i=0;i<5;i++)
{
list = insert(list,i);
}
printList(list);
}
}