Answered step by step
Verified Expert Solution
Question
1 Approved Answer
can you change the following code according to the instruction and units and finish the rest please. #include #include #include #include using namespace std; struct
can you change the following code according to the instruction and units and finish the rest please.
#include#include #include #include using namespace std; struct LinkNode { void *data; LinkNode* next; }; LinkNode* head; class Slinklist { private: int counts; LinkNode* start; LinkNode* end; public: Slinklist(){ head = NULL; } //setter for LinkList class void set_count(int count) { this->counts = count; } void set_start(LinkNode* start) { this->start = start; } void set_end(LinkNode* end) { this->end = end; } int get_count() { return this->counts; } LinkNode* get_start() { return this->start; } LinkNode* get_end() { return this->end; } void insert(void* data) { LinkNode* node; node = new LinkNode(); node->data = data; node->next = NULL; if (head == NULL) head = node; else { LinkNode *a = head; while (a->next != NULL) { a = a->next; } a->next = node; } } void Remove(void *data) { int n = 0; int n1 = 0; LinkNode *p = head; LinkNode *p1 = head; if (p== NULL) { cout data == *(int *)data) break; prev = p; p = p->next; } prev->next = p->next; free(p); cout data next; } } } void search(void *data) { int check = 0; LinkNode *p = head; if (p == NULL) cout data == *(int *)data) { check++; goto show; } p = p->next; } show: if (check == 0) cout data; } } void count() { LinkNode *p = head; int count = 0; while (p != NULL) { count++; p = p->next; } cout data == data) { p->data = newData; check++; } p = p->next; } if (check == 0) cout data = data; stack->next = NULL; head = stack; } else { stack->data = data; stack->next = head; head = stack; } cout data; } void pop(){ cout data next; } void peek(){ cout data; } void Empty() { LinkNode* temp = head; LinkNode* next; while (temp!=NULL) { next = temp->next; free(temp); temp = next; } cout data = data; queue->next = NULL; if (head == NULL) head = queue; else { LinkNode* temp = head; while (temp->next!=NULL) { temp = temp->next; } temp->next = queue; } cout data; head = head->next; } } void peekFront(){ if (head == NULL) cout data; } } void peekRear(){ if (head == NULL) cout next!=NULL) { temp = temp->next; } cout data; } } void Empty(){ LinkNode* temp = head; LinkNode* next; while (temp != NULL) { next = temp->next; free(temp); temp = next; } cout insert(new int(10)); list->insert(new int(20)); list->insert(new int(30)); list->insert(new int(40)); list->insert(new int(50)); list->display(); list->Remove(new int(30)); list->display(); list->count(); list->search(new int(40)); cout push(new string("A")); stack->push(new string("B")); stack->pop(); stack->push(new string("C")); stack->push(new string("D")); stack->push(new string("E")); cout enqueue(new string("QA")); queue->enqueue(new string("QB")); queue->dequeue(); queue->enqueue(new string("QC")); queue->enqueue(new string("QD")); queue->enqueue(new string("QE")); }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Systems For Advanced Applications 16th International Conference Dasfaa 2011 International Workshops Gdb Sim3 Flashdb Snsmw Damen Dqis Hong Kong China April 2011 Proceedings Lncs 6637
Authors: Jianliang Xu ,Ge Yu ,Shuigeng Zhou ,Rainer Unland
2011th Edition
3642202438, 978-3642202438
