#include <iostream>

#include <cassert>

using namespace std;

class Node

{

typedef Node* NodePtr;

private:

int data;

NodePtr link;

public:

Node();

Node(const int &);

Node(const Node &);

int getData() const;

NodePtr getLink() const;

void setData(const int &);

void setLink(const NodePtr &);

friend ostream& operator << (ostream &, const Node &);

};

typedef Node* NodePtr;

Node::Node() : data(0), link(nullptr) {}

Node::Node(const int &d) : data(d), link(nullptr){}

Node::Node(const Node &n) : data(n.data), link(n.link){}

int Node::getData() const { return data; }

NodePtr Node::getLink() const { return link; }

void Node::setData(const int &d) { data = d; }

void Node::setLink(const NodePtr &p) { link = p; }

ostream& operator << (ostream& out, const Node& n)

{

out << n.data;

return out;

}

typedef Node* NodePtr;

class LinkedList

{

private:

NodePtr head;

public:

LinkedList(); //default constructor: assigns the head pointer member variable a nullptr value LinkedList(const LinkedList &); //copy constructor (deep copy)

~LinkedList(); //destructor (must delete all the nodes from the heap) LinkedList& operator= (const LinkedList &); //Assignment operator (deep copy)

bool isEmpty() const; //return true if the length of the calling object is 0 and false otherwise NodePtr getHeadPtr() const; //return the head member variable of the calling object int getLength() const; //return the number of nodes in the calling object

void head_insert(const int &); //as described in the supplementary material

NodePtr search_node(const int &) const; //as described in the supplementary material

void insert_after(const NodePtr &, const int &) const; //as described in the supplementary material

void remove_node(const NodePtr &); //as described in the supplementary material void remove_node(const int &); //as described in the supplementary material void remove_all(const int &); //as described in the supplementary material void tail_insert(const int &); //as described in the supplementary material

void insert_before(const NodePtr &, const int &); //as described in the supplementary material

friend ostream& operator << (ostream&, const LinkedList &); //Implemented for you };

ostream& operator << (ostream &out, const LinkedList &LL)

{

if (LL.isEmpty())

out << "EMPTY LINKED LIST";

else

{

NodePtr temp = LL.head;

while(temp != nullptr)

{

out << *temp << " ";

temp = temp->getLink();

}

}

return out;

}