Algorithm to find the nth to last element of a singly linked list
Answers
Answered by
5
Given a Linked List and a number n, write a function returns the value at
n’th node from end of the Linked List.
For example, if input is below list and n = 3, then output is “B”

n’th node from end of the Linked List.
For example, if input is below list and n = 3, then output is “B”

boy2255:
hi
Similar questions