-
Notifications
You must be signed in to change notification settings - Fork 2
/
doulinkedlist.java
100 lines (92 loc) · 2.13 KB
/
doulinkedlist.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
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
import java.util.Scanner;
class Node
{
int data;
Node next;
Node prev;
public Node(int data)
{
this.data=data;
this.next=null;
this.prev=null;
}
}
class Double
{
Node head;
public Double()
{
this.head=null;
}
public void insertnode(int data)
{
Node newNode = new Node(data);
if(head==null)
{
head=newNode;
}
else
{
Node temp = head;
while (temp.next != null)
{
temp = temp.next;
}
temp.next = newNode;
newNode.prev = temp;
}
}
public void delete(int key)
{
Node current = head;
while (current != null)
{
if (current.data == key) {
if (current.prev != null) {
current.prev.next = current.next;
} else {
head = current.next;
}
if (current.next != null) {
current.next.prev = current.prev;
}
System.out.println("Element " + key + " deleted from the list.");
return;
}
current = current.next;
}
System.out.println("Element " + key + " not found in the list.");
}
public void display()
{
Node temp=head;
System.out.println("Elements in the list:");
while(temp!=null)
{
System.out.println(temp.data+ "");
temp=temp.next;
}
}
}
public class Main
{
public static void main(String[]args)
{
Double o=new Double();
Scanner n = new Scanner(System.in);
System.out.println("Enter the no of elements in the list:");
int num=n.nextInt();
int i;
System.out.println("Enter the elements of list:");
for(i=0;i<num;i++)
{
int element=n.nextInt();
o.insertnode(element);
}
o.display();
System.out.println("Enter the element to be deleted:");
int key=n.nextInt();
o.delete(key);
o.display();
}
}