- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfetching_node.java
More file actions
Latest commit
52 lines (46 loc) · 1.01 KB
/
Copy pathfetching_node.java
File metadata and controls
52 lines (46 loc) · 1.01 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
//fetching node from the provided key
classNode
{
Nodenext;
intdata;
Node(intd)
{
data=d;
next=null;
}
}
publicclassFetchnode
{
Nodehead;
publicvoidinsert(intelement)
{
Noden = newNode(element);
n.next=head;
head = n;
}
publicintfetch(intkey)
{
Nodepresent = head;
intcount=0;
while(present!=null)
{
if(count==key)
return(present.data);
count++;
present=present.next;
}
assert(false); //wrong choice
//assert statement is used to declare an expected boolean condition in a program
return0;
}
publicstaticvoidmain(Stringargs[])
{
Fetchnodefl = newFetchnode();
fl.insert(20);
fl.insert(645);
fl.insert(1436);
fl.insert(35);
fl.insert(23);
System.out.println("Element at index 2 is "+fl.fetch(2));
}
}