Linked List Question

[CirKuT]

Hello Everyone,

Im learning about linked lists and have been practicing a bit from a book. I have created a linked list and now I want to make a copy of this linked list but in backwards other.

When I create a copy of listA and name it listB I need to be able to print them like this. My book does not cover copying linked lists.

linked list A: 1,2,3,4,5
linked list B: 5,4,3,2,1

Below is one class in my three class package. The very bottom deals with added data to linked list A from there is where I need to create a copy. If you need me to post the other 2 classes I can but they just contain methods to insert and delete from the front or back of the list etc etc etc

package LinkedList;

/**
*
* @author CirKuT
*/
public class ListTest {


public static void main (String args[]){


//Creates a Linked List
List listA = new List();

listA.insertAtFront("J");
listA.insertAtFront("F");
listA.insertAtFront("E");
listA.insertAtFront("D");
listA.insertAtFront("C");
listA.insertAtFront("B");
listA.insertAtFront("A");

//Prints listA from head to tail
listA.Print();

//Create a physcial copy of the first linked list but in backwards order
//called ListB


}

}

Any help would be appreciated

[Rajesh_J2EE]

Since you had already wrote the code for push operation, now write the code for pop, while doing the pop operation just copy each element into second list, or you can write a method to reversing a linked list, call that method and assign it new list.

[CirKuT]

I would prefer to use a method but how exactly do I go about doing this? Im still rather new to Java so I still have problems writing all my own code.

Since my first linked list is named linkA like shown below,

Link linkA = new Link();

To created the second list I just used this line

Link linkB = linkA;

Now I just need to reverse it before I use this method to print it

linkB.Print();

Any suggestions?

[neilcoffey]

Two simple solutions, depending on how you've created your list class:
(1) make your class implement a DOUBLY linked list, where each item in the list "points" to both the next and *previous* item, and where the list always contains a reference to both the first and last items -- then it's trivial to just start at the end of the list, and follow the "pointers" backwards to get the items in reverse order;
(2) if your pointers only go forwards, then copy all the items into an array, then copy the items out of the array from end to beginning to get them into a new list in reverse order.

[CirKuT]

Ok,

So can I copy to an array the same as I created the listB?

All I did was take listA and do this

List listB = listA;

So if I had an array named arrayC could I just go like this

arrayC = listA; ???? would that work??

If so then how would I copy each element of the new array into the new linked list listB??

I really could use an example on how to do this in the form of syntax.

Thanks everyone for your help