Question

C++

void CLL::push(char data) { // You write - if the size is 0, add a first node in the linked list

// by calling addFirst. Otherwise add a new node to the end of the linked list. Note that this

// linked list is circular, so you must make the last node's next pointer point to the first node.

}

void CLL::addFirst(char data) {

// you write - add the very first node to the linked list

}

void CLL::addAtFront(char data) {

// you write - if the size of the linked list is 0, add a first node by calling addFirst.

//Otherwise add a new node to the beginning of the list

//Since this linked list is circular, you must make the last node now point to this new node

//you just added to the front of the linked list

}

void CLL::removeNext(SNode *n) {

// Longest method - given node n, remove the next node in the linked list.

// you have 4 conditions:

//1: there's only one node in the list, in which case you delete that node and set the size to 0

//2: n's next node is a last node, in which case n becomes the new last node and n's next must point

//               to the first node in the list (remember to decrease the size of the list)

//3: n's next node is the first node in the list (i.e., n is the last node in the list), in which case

//               n's next becomes first's next, first is deleted, and first becomes n's next (again, remember

//               to decrease the size)

//4: n is just some node in the middle of the list, in which case you should create a tmp node to point

//               to n's next, then set n's next to n's next's next, and then delete the tmp node (again, decrease

//               size).

}

void CLL::printList(){

// print out the data in each node in the linked list, starting at the first node.

}

You will also be modifying the file DuckDuckGoose.cpp to fill in the methods as defined below:

Answer 1

If you have any doubts, please give me comment...

CLL.h

struct SNode{

char data;

SNode *next;

};

#ifndef CLL_H

#define CLL_H

class CLL{

public:

CLL(){

head = NULL;

size = 0;

}

void push(char data);

void addFirst(char data);

void addAtFront(char data);

void removeNext(SNode *n);

void printList();

private:

SNode *head;

int size;

};

#endif

CLL.cpp

#include "CLL.h"

void CLL::push(char data){

if(size==0){

addFirst(data);

}

else{

SNode *n = new SNode();

n->data = data;

n->next = head;

SNode *temp = head;

int i=0;

while(i<size-1){

temp = temp->next;

i++;

}

temp->next = n;

size++;

}

}

void CLL::addFirst(char data){

SNode *n = new SNode();

n->data = data;

n->next = NULL;

head = n;

size++;

}

void CLL::addAtFront(char data){

if(size==0){

addFirst(data);

}

else{

SNode *n = new SNode();

n->data = data;

n->next = head;

head = n;

size++;

}

}

void CLL::removeNext(SNode *n){

if(size==1){

delete head;

head = NULL;

}

else{

SNode *temp = head;

int i=0;

while(temp!=n){

temp = temp->next;

i++;

}

delete temp->next;

temp->next = head;

size--;

}

}

void CLL::printList(){

int i=0;

SNode *temp = head;

while(i<size){

cout<<temp->data<<" ";

temp = temp->next;

i++;

}

cout<<endl;

}

You didn't mentioned file DuckDuckGoose.cpp file.... so I mentioned my file

main.cpp

#include<iostream>

using namespace std;

#include "CLL.cpp"

int main(){

CLL *list = new CLL();

list->push('A');

list->addAtFront('B');

list->push('C');

list->push('D');

list->printList();

return 0;

}

[anunagaoanunaga 16042018]$ gt+ main.cpp [anunaga@anunaga 16042018]$ ./a.out BACD