-
Notifications
You must be signed in to change notification settings - Fork 1
/
deleteNodeWithoutHeadPointer.java
122 lines (106 loc) · 1.94 KB
/
deleteNodeWithoutHeadPointer.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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
import java.util.*;
class Node
{
int data ;
Node next;
Node(int d)
{
data = d;
next = null;
}
}
class Delete_Node
{
Node head;
Node tail;
void printList(Node head)
{
Node tnode = head;
while(tnode != null)
{
System.out.print(tnode.data+ " ");
tnode = tnode.next;
}
System.out.println();
}
void addToTheLast(Node node)
{
if(head == null)
{
head = node;
tail = node;
}
else
{
tail.next = node;
tail = node;
}
}
Node search_Node(Node head, int k)
{
Node current = head;
while(current != null)
{
if(current.data == k)
break;
current = current.next;
}
return current;
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t>0)
{
int n = sc.nextInt();
Delete_Node llist = new Delete_Node();
//int n=Integer.parseInt(br.readLine());
int a1=sc.nextInt();
Node head= new Node(a1);
llist.addToTheLast(head);
for (int i = 1; i < n; i++)
{
int a = sc.nextInt();
llist.addToTheLast(new Node(a));
}
int k = sc.nextInt();
Node del = llist.search_Node(llist.head,k);
GfG g = new GfG();
if(del != null && del.next != null)
{
g.deleteNode(del);
}
llist.printList(llist.head);
t--;
}
}
}
// } Driver Code Ends
/*
class Node
{
int data ;
Node next;
Node(int d)
{
data = d;
next = null;
}
}
*/
// This function should delete node from linked list. The function
// may assume that node exists in linked list and is not last node
// node: reference to the node which is to be deleted
class GfG
{
void deleteNode(Node node)
{
// here we have access of only the node which is to be deleted
//so we will copy the value of next node in given node and we will delete next node;
//copying next node value;
node.data=node.next.data;
//deleting next node;
node.next=node.next.next;
}
}