Write a program that creates a linked list object of 10 characters and creates a second list object containing a copy of the first list, but in reverse order.

Question

What will be an ideal response?

Answer 1

```
#include
using namespace std;

#include "List.h"

// function template that takes two List objects as arguments
// and makes a copy of the second argument reversed in the first argument.
template< typename T >
void reverseList( List< T > &first, List< T > &second )
{
List< T > temp( second ); // create a copy of second
T value; // variable to store removed item from temp

// loop through the list until it is empty
while ( !temp.isEmpty() )
{
temp.removeFromFront( value ); // remove value from temp list
first.insertAtFront( value ); // insert at beginning of first list
} // end while
} // end reverseList template function

int main()
{
List< char > list1;
List< char > list2;

// insert a - g onto list1
for ( char c = 'a'; c <= 'j'; c++ )
list1.insertAtBack( c );

list1.print(); // print list
reverseList( list2, list1 ); // call to function reverseList

cout << "The list after reversing:\n";
list2.print(); // print list
return 0; // indicates successful termination
} // end main
```
The list is: a b c d e f g h i j
All nodes destroyed
The list after reversing:
The list is: j i h g f e d c b a
Destroying nodes ...
j i h g f e d c b a
All nodes destroyed
Destroying nodes ...
a b c d e f g h i j
All nodes destroyed