FilesExpand file tree

 master

/

middle_element.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

62 lines (58 loc) · 1.23 KB

 master

/

middle_element.java

Copy path

Top

File metadata and controls

• Code
• Blame

62 lines (58 loc) · 1.23 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

//finding middle

public class Middle

{

Node head;

class Node

{

int data;

Node next;

Node(int d)

{

data=d;

next=null;

}

}

void middlele()

{

Node ptr1=head;

Node ptr2=head;

if(head!=null)

{

while(ptr2!=null && ptr2.next!=null)

{

ptr2 = ptr2.next.next; //going two elements ahead

ptr1 = ptr1.next;

}

System.out.println("=*=MIDDLE ELEMENT=*="+ ptr1.data);

}

}

void insert(int element)

{

Node n = new Node(element);

n.next=head;

head=n;

}

void print()

{

Node no=head;

while(no!=null)

{

System.out.print(no.data+" ");

no=no.next;

}

System.out.println();

}

public static void main(String args[])

{

Middle m = new Middle();

m.insert(1);

m.insert(2);

m.insert(3);

m.insert(4);

m.insert(5);

//m.insert(6);

//when the number of elements is even, it returns the second element of the two middle elements.

m.print();

m.middlele();

}

}