-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDoubly_Linked_List.java
More file actions
113 lines (105 loc) · 3.24 KB
/
Copy pathDoubly_Linked_List.java
File metadata and controls
113 lines (105 loc) · 3.24 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
113
//Java program for implemention of Doubly linked list
import java.util.Scanner;
class DLL {
Node head = null;
class Node {
int data;
Node next, prev;
public Node(int data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
public void insert(int data) {
Node temp = new Node(data);
if (head == null) {
head = temp;
} else {
Node ptr = head;
while (ptr.next != null) {
ptr = ptr.next;
}
ptr.next = temp;
temp.prev = ptr;
}
System.out.print("Data enterd is : " + data);
}
public void delete(int x) {
Node temp = new Node(1);
if (head == null) {
System.out.print("List is empty");
} else {
temp = head;
while (temp != null && temp.data != x)
temp = temp.next;
if (temp == null)
System.out.println("Not found");
else {
int data = temp.data;
if (temp.next == null && temp.prev == null) {
temp = null;
head = null;
} else if (temp.next == null)
temp.prev.next = null;
else if (temp.prev == null) {
head = temp.next;
temp.next.prev = null;
} else {
temp.prev.next = temp.next;
temp.next.prev = temp.prev;
}
System.out.print("Data deleted is : " + data);
}
}
}
public void display() {
Node temp = head;
if (head == null) {
System.out.print("List is empty");
} else {
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
}
}
}
public class Doubly_Linked_List {
public static void main(String args[]) {
DLL dll = new DLL();
int opt;
do {
System.out.println("\n1. Insert at end 2. Delete a element 3. Display linked list 4. Exit");
System.out.print("Enter your choice : ");
Scanner sc = new Scanner(System.in);
opt = sc.nextInt();
switch (opt)
{
case 1: {
System.out.print("Enter the element : ");
int data = sc.nextInt();
dll.insert(data);
break;
}
case 2: {
System.out.println("Enter element to be deleted : ");
int x = sc.nextInt();
dll.delete(x);
break;
}
case 3: {
dll.display();
break;
}
case 4: {
break;
}
default: {
System.out.print("Invalid choice");
break;
}
}sc.close();
} while (opt != 4);
}
}