Let string is stord as linked list. Plese tell me the Steps to reverse a string using singly linked list.?

Answer 1

recursively, it's reverse(tail(list)) + head(list)

Answer 2

steps:
1.take the count as 0
2. traverse the list from beginning and store it in the array and increase the count
3. display the strings of array 0 to last count


please correct if i am wrong

Answer 3

Roll-your-very own LinkedList makes me go-eyed. I would desire to have the variables head and runner ==> runner = head; ==> runner = runner.next; have faith it or do not ... recursion is meant to be the least puzzling thank you to LIFO a LinkedList. i will purely advise the answer. i can't save on with a homebrew linkedList until eventually I wrote it.

Answer 4

reverse the node pointers,then traverse through the list

Answer 5

If your course have not get to Recursion a for loop would do:

LLNode temp = head;
LLNode result = null;
for (int x = 0; x < head.size(); x++) {
LLNode rest = result;
result = new LLNode(temp.data());
result.addTrain(rest);
temp = temp.next();
}