-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDLL.java
More file actions
112 lines (103 loc) · 2.68 KB
/
DLL.java
File metadata and controls
112 lines (103 loc) · 2.68 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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
public class DLL{
Node head;
Node tail;
public DLL(){
this.head=null;
this.tail=null;
}
class Node{
int data;
Node next;
Node prev;
public Node(int data){
this.data=data;
this.next=null;
this.prev=null;
}
}
public void insertFirst(int data){
Node newNode=new Node(data);
if(head==null){
head=newNode;
tail=newNode;
}else{
newNode.next=head;
head.prev=newNode;
head=newNode;
}
}
public void insertLast(int data){
Node newNode=new Node(data);
if(tail==null){
head=newNode;
tail=newNode;
}else{
tail.next=newNode;//tail of prev-->newNode;
newNode.prev=tail;
tail=newNode;
}
}
public void printForward(){
Node current=head;
if(head==null){
System.out.println("List is empty");
}else{
while(current!=null){
System.out.println(current.data);
current=current.next;
}
}
}
public void printLast(){
Node current=tail;
if(tail==null){
System.out.println("List is empty");
}else{
while(current!=null){
System.out.println(current.data);
current=current.prev;
}
}
}
public void deleteFirst(){
if(head==null){
System.out.println("List is empty");
return;
}
if(head==tail){
head=null;
tail=null;
}else{
head=head.next;//updating first to second
head.prev=null;//deleting first
}
}
public void deleteLast(){
if(tail==null){
System.out.print("list is empty");
}
if(head==tail){
tail=null;
head=null;
}else{
tail=tail.prev;//update tail value from last to second last;
tail.next=null;//delete the last value;
}
}
public static void main(String[] args){
DLL dl=new DLL();
dl.insertFirst(2);
dl.insertFirst(1);
dl.insertLast(3);
dl.insertLast(4);
dl.insertLast(5);
System.out.println("forward: ");
dl.printForward();
System.out.println("Backward");
dl.printLast();
dl.deleteFirst();
dl.deleteLast();
System.out.println("After deletion");
dl.printForward();
}
}