CSC1310: LAB 4

Question

CSC1310: LAB 4

Chinni Guna Venkata Prasanth · Accepted Answer

#ifndef LIST_H #define LIST_H #include "DataSource.h" #include "SLelement.h" #include using namespace bridges; class List { private: SLelement* head; SLelement* tail; int size; public: List(); List(vector books); ~List(); void appendNode(GutenbergBook book); void insertNode(int index, GutenbergBook book); void deleteNode(int index); SLelement* getHead() { return head; } int getSize() { return size; } }; #endif List::List() { head = NULL; tail = NULL; size = 0; } List::~List() { // if the list in not empty if(head) { SLelement* a = head; SLelement* b = NULL; // go thorugh all the nodes and delete them while(a != NULL) { b = a; a = a->next; delete b; } } size = 0; } List::List(vector books ) { // for each element in the vector we append it to the list for(GutenbergBook b : books) { appendNode(b); } } void List::appendNode(GutenbergBook book) { SLelement* new_ele = new SLelement(); new_ele->setNext(NULL); new_ele->setLabel(book); // if the list is empty then head and tail both point to this new element if(head == NULL) { head = new_ele; tail = new_ele; } // else we add this node after the tail node and update the value of tail pointer else { SLelement* temp = tail; temp->next = (new_ele); tail = new_ele; } // update the size size++; } void List::insertNode(int index, GutenbergBook book) { // check whether the index passed is valid if(index > size || index <0){ cout<<"Index out of bound!"<* new_ele = new SLelement(); new_ele->setNext(NULL); new_ele->setLabel(book); // update head if new node is inserted at first position if(index == 0){ new_ele->next = head; head = new_ele; size++; return; } // for any other position go down the list and search for it int count = 0; SLelement* temp = head; while(temp!=NULL && count next != NULL) { new_ele->next = temp->next; } // if the new element is added in the last position we update tail pointer else { tail = new_ele; } temp->next = new_ele; break; } count++; temp = temp->next; } // update size size++; } void List::void deleteNode(int index) { if(head == NULL){ cout<<"List is empty !"< size || index <0){ cout<<"Index out of bound!"<next; // if there is only element, update tail accordingly if(size == 1) { tail = head; } size--; return; } int count = 0; SLelement* temp = head; while(temp != NULL) { if(count == index-1) { // if the item to be deleted is the last element shift the tail pointer to the second last element if(tail == temp->next) { tail = temp; } temp->next = temp->next->next; break; } count++; temp = temp->next; } // update size size--; }

CSC1310: LAB 4

Get Instant Homework HelpOn Your Mobile

Get Instant Homework HelpOn Your Mobile