Question

C++ program:

Convert the classes to template classes

#include <iostream>
#include <string>
using namespace std;
class Node {
  private:
    int data;
    Node* next;
  public:
    Node(int data) {  
      this->data=data;
      this->next = 0;
    }
    int getData(){return data;}
    Node* getNext(){return next;}
    void setNext(Node* next){this->next=next;}
};
class LinkedList {
  private:
    Node* head = 0;
  public:
    int isEmpty() {return head == 0;}
    void print() {
      Node* currNode = head;      
      while(currNode!=0) {
        cout << currNode->getData() << endl;
        currNode = currNode->getNext();
      }
    }
    void append(int data) {
      if(head == 0)
        head = new Node(data);
      else{
        Node* lastNode = head;
        while(lastNode->getNext()!=0)
          lastNode = lastNode->getNext();

        Node* newNode = new Node(data);
        lastNode->setNext(newNode);
      }
    }
    void recursiveDeleteAll() {
      recursiveDeleteAll(head);
      head=0;
    }
    void recursiveDeleteAll(Node* currNode){
      if(currNode != 0){
        recursiveDeleteAll(currNode->getNext());
        delete currNode;
      }
    }
    ~LinkedList() {
      recursiveDeleteAll();
/*
      Node* nodePtr = head;
      while(head!=0) {
        head = head->getNext();
        delete nodePtr;
        nodePtr = head;
      }
*/
    }
};
int main() {
  LinkedList myList;
  myList.append(99);
  myList.append(4);
  myList.append(0);
  myList.append(5);
  myList.print();
}

Answer 1

private: 8 9 10 clang version 7.8.0-3-ubuntue.18.84.1 (tags/RELEASE 7e8/final) T data; Node next; clang++-7 -pthread -o ain main.cpp public: Node (T data) ( 12 13 14 15 16 17 18 19 20 21 templatexclass T> this->data-data; this->next; T getData)(return data;) Node* getNext ()(return next; void setNext (Node next)this->next-next; 22 class LinkedList private: 23 24 25 26 27 28 29 30 31 32 Node<T>head 0 public: int isEmpty() freturn head; void print() Node<T>* currNode while(currNode!-0) head; { cout << currNode->getData <endl; currNodecurrNode->getNext); void append (T data) { 34 35 36 37 38 39 40 if(head 0) head else( Node<T>(data); new = Node<T lastNode -head; while(lastNode->getNext()1-0) lastNodelastNode->getNext);


#include <iostream>
#include <string>

using namespace std;

template<class T>
class Node {
  private:
    T data;
    Node* next;
  public:
    Node(T data) {  
      this->data=data;
      this->next = 0;
    }
    T getData(){return data;}
    Node* getNext(){return next;}
    void setNext(Node* next){this->next=next;}
};

template<class T>
class LinkedList {
  private:
    Node<T>* head = 0;
  public:
    int isEmpty() {return head == 0;}
    void print() {
      Node<T>* currNode = head;      
      while(currNode!=0) {
        cout << currNode->getData() << endl;
        currNode = currNode->getNext();
      }
    }
    void append(T data) {
      if(head == 0)
        head = new Node<T>(data);
      else{
        Node<T>* lastNode = head;
        while(lastNode->getNext()!=0)
          lastNode = lastNode->getNext();

        Node<T>* newNode = new Node<T>(data);
        lastNode->setNext(newNode);
      }
    }
    void recursiveDeleteAll() {
      recursiveDeleteAll(head);
      head=0;
    }
    void recursiveDeleteAll(Node<T>* currNode){
      if(currNode != 0){
        recursiveDeleteAll(currNode->getNext());
        delete currNode;
      }
    }
    ~LinkedList() {
      recursiveDeleteAll();
/*
      Node* nodePtr = head;
      while(head!=0) {
        head = head->getNext();
        delete nodePtr;
        nodePtr = head;
      }
*/
    }
};

int main() {
  LinkedList<int> myList;
  myList.append(99);
  myList.append(4);
  myList.append(0);
  myList.append(5);
  myList.print();
}

Please upvote, as i have given the exact answer as asked in question. Still in case of any issues in code, let me know in comments. Thanks!