Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Recursive function based on Linked list
Hi I have a problem. I have to create a 'recursive loop' to search each node in a single linked list for the smallest value and return the node before that node.
I was hoping to solve this problem by using the previous and current nodes.
Now my problem is if the value appears in the middle of the list, then how can I still come back to the prev node of the smallest value after searching the whole list.
Re: Linked list
Can you write some of your code please?
Have you tried with elementAt method and handle with integers?
Last edited by leandro; March 9th, 2009 at 07:30 PM.
Reply With Quote
Related threads: