FilesExpand file tree

 master

/

LinkedListFindNodeFromEnd.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (41 loc) · 925 Bytes

 master

/

LinkedListFindNodeFromEnd.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (41 loc) · 925 Bytes

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

package misc;

class Node {

int data;

Node next;

Node(int d) {

data = d;

next = null;

}

}

public class LinkedListFindNodeFromEnd {

Node head;

// Function to get the nth node from the last of a linedList

public int getNodeFromLinkedList(int index) {

Node current = head;

int count = 1;

while(current != null) {

if(count == index) {

return current.data;

}

count++;

current = current.next;

}

assert(false);

return 0;

}

/* Inserts a new Node at front of the list. */

public void push(int data) {

Node node = new Node(data);

node.next = head;

head = node;

}

public static void main(String[] args) {

LinkedListFindNodeFromEnd linkedList = new LinkedListFindNodeFromEnd();

linkedList.push(10);

linkedList.push(20);

linkedList.push(30);

linkedList.push(40);

linkedList.push(50);

System.out.println("Element at index 2: "+linkedList.getNodeFromLinkedList(2));

}

}