There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it so complicated that there are no obvious deficiencies. C.A.R. Hoare

Find last Nth node

Language Java | Level Intermediate | Category Data structure | September 4, 2015 8:56 pm


Data structure Description

Write a program to find last Nth node from singly linked list using single iteration. Linked list do not use index and uses only reference to next item.


Output

   					 

Insert items in LinkedList:9, 43, 34, 11, 78, 55
9->43->34->11->78->55->NULL
Last 3 rd Item from linked list using single iteration:11 

				    

Comments


No comments available!

Please login to add comments.