Question

Using a class template, write a linked list with 5 nodes and print the linked list. Then make a second linked list with the values from the first linked list and reverse the values and print. (C++)

Answer 1

// do comment if any problem arises

// code

#include <iostream>

using namespace std;

template <class T>

struct node

{

    T data;

    node *next;

};

template <class T>

class LinkedList

{

public:

    // head of linked list

    node<T> *head;

    // default constructor

    LinkedList()

    {

        head = NULL;

    }

    // insert at top of list

    void insert(T item)

    {

        node<T> *temp = head;

        head = new node<T>;

        head->data = item;

        head->next = temp;

    }

    // print list

    void print()

    {

        node<T> *temp = head;

        while (temp != NULL)

        {

            cout << temp->data << " ";

            temp = temp->next;

        }

        cout << endl;

    }

};

template <class T>

// this function inserts element in given list in reverse order

void reverse(LinkedList<T> from, LinkedList<T> &to)

{

    node<T> *temp = from.head;

    while (temp != NULL)

    {

        to.insert(temp->data);

        temp = temp->next;

    }

}

int main()

{

    // create linkel list with 5 elements

    LinkedList<int> testing;

    testing.insert(4);

    testing.insert(1);

    testing.insert(34);

    testing.insert(98);

    testing.print();

    // create list with reverse

    LinkedList<int> reverse_list;

    reverse(testing, reverse_list);

    cout << "After reverse: ";

    reverse_list.print();

}

Output:

98 34 1 4 After reverse: 4 1 34 98 ns. I fiyon