LinkedList.cpp

// LinkedList.cpp -- class for a linked list as a data structure

#ifndef LINKEDLIST_CPP
#define LINKEDLIST_CPP

#include <iostream>
using namespace std;

template <typename T>
struct Node {
  T info;
  Node<T> *next;
};

template <typename T>
class LinkedList {
  Node<T> *start;
 public:
 int size = 0;
  LinkedList() { start = NULL; }
  ~LinkedList() { makeEmpty(); }
  // inserts at the beginning of the linked list
  void insertFront (T & element ) {
    Node<T> *newNode = new Node<T>;
    newNode->info = element;
    newNode->next = start;
    start = newNode;
	  ++size;
  }
  // returns true if element is found; returns false if element is not found
  int find (T & target) {
    bool found = false;
    int index = -1;
    Node<T> *ptr = start;
    while (ptr != NULL && !found) {
      if (ptr->info == target) {
        found = true;
        ++index;
      }  
      else{
        ptr = ptr->next;
        ++index;
      }
        
    }
    return index;
  }
  T getLast(){ // returns first item in list.
    Node<T> *ptr = start;
    while (ptr ->next != NULL) {
        ptr = ptr->next;
    }
      return ptr -> info;
  }

  bool isEmpty() { return start == NULL; }
  void makeEmpty() {
    while (start != NULL) {
      Node<T> *ptr  = start;
      start = start->next;
      delete ptr;
    }
  }
  friend ostream& operator<< (ostream& os, LinkedList<T>& list) {
    Node<T> *ptr = list.start;
    while (ptr != NULL) {
      os << ptr->info << " ";
      ptr = ptr->next;
    }
    return os;
  }
};
#endif