forked from girijamanoj/Basic-Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathDoublyList.java
More file actions
57 lines (52 loc) · 1.04 KB
/
Copy pathDoublyList.java
File metadata and controls
57 lines (52 loc) · 1.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
class Node {
int data;
Node next;
Node prev;
Node (int data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
class Linkedlist {
Node head, tail;
public Linkedlist() {
this.head = null;
this.tail = null;
}
public void addDouble(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
} else {
Node temp;
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
}
}
public void print() {
Node temp;
for(temp = head; temp != null; temp = temp.next) {
System.out.println(temp.data);
}
}
public void printRev() {
Node temp;
for(temp = tail; temp != null; temp = temp.prev) {
System.out.println(temp.data);
}
}
}
public class DoublyList {
public static void main(String[] args) {
Linkedlist l = new Linkedlist();
l.addDouble(2);
l.addDouble(3);
l.addDouble(4);
l.addDouble(5);
l.print();
l.printRev();
}
}