(Solved) : Llisth Code Ifndef Llisth Define Llisth Include Include Define Int Int Using Namespace Std Q28247156 . . . .

LList.h code

#ifndef LLIST_H#define LLIST_H#include <ostream>#include <stdexcept>#define int intusing namespace std;struct node_t {int data;node_t* next;};// This implementation will use ahead pointer,// allowing O(1) insertion on thefront,// and O(n) on the end.class LList {public:LList(){head = NULL;}~LList(){clear();}LList(const LList& other){// Do the same as the defaultconstructorhead = NULL;// Check if the other LList isemptyif(other.head == NULL){return;}// Not empty? Iterate through theother list// and push_back on myself.node_t* temp = other.head;while(temp){push_back(temp->data);temp = temp->next;}}// Similar to copy constructor, butcheck for self// assignment, if not, clear andcopy all data.LList& operator= (constLList& other){if(this == &other){return *this;}clear();if(other.head == NULL){return *this;}node_t* temp = other.head;while(temp){push_back(temp->data);temp = temp->next;}return *this;}bool empty() const {// TODO: