Question: Please modify the code as follows. Add a function named swapLastWithFirst which swaps the first node with the last node. Thereafter, the main function should

Please modify the code as follows.
Add a function named "swapLastWithFirst" which swaps the first node with the last node. Thereafter, the "main" function should call "swapLastWithFirst" and then call "printList".
#include
using namespace std;
struct Node
{
char data;
struct Node *next;
};
struct Node *head=NULL;
void printList()
{
Node* curr = head;
while(curr->next != head){
cout << curr->data <<"";
curr = curr->next;
}
cout << curr->data <<"";
cout << endl;
}
void insertFirst(char data){
Node* newNode = new Node;
newNode->data = data;
newNode->next = NULL;
if(head == NULL){
head = newNode;
newNode->next = head;
}
else {
Node* curr = head;
while(curr->next != head)
curr = curr->next;
curr->next = newNode;
newNode->next = head;
head = newNode;
}
}
void insertLast(char data){
Node* newNode = new Node;
newNode->data = data;
newNode->next = NULL;
if(head == NULL){
head = newNode;
newNode->next = head;
}
else {
Node* curr = head;
while(curr->next != head)
curr = curr->next;
curr->next = newNode;
newNode->next = head;
}
}
void insertAtPos(char data, int pos){
Node* newNode = new Node;
newNode->data = data;
newNode->next = NULL;
int curPos =1;
if(head == NULL){
head = newNode;
newNode->next = head;
}
else{
Node *curr = head;
Node *prev;
while(curPos != pos && curr->next != head){
prev=curr;
curr = curr->next;
curPos++;
}
prev->next = newNode;
newNode->next = curr;
}
}
void deleteAtPos(int pos){
Node* curr = head;
int curPos =1;
if (head !=NULL){
if(pos ==1){
while(curr->next != head){
curr = curr->next;
}
curr->next = head->next;
Node *temp = head;
head = temp->next;
delete temp;
}
else{
Node *prev;
while(curPos != pos && curr->next != head){
prev=curr;
curr = curr->next;
curPos++;
}
prev->next = curr->next;
delete curr;
}
}
}
int search(char value)
{
int pos =1;
Node* curr = head;
if(head != NULL)
{
do{
if(curr->data == value)
return pos;
pos++;
curr = curr->next;
} while(curr != head);
}
return -1;
}
int main(){
cout << "Hello World!
";
insertFirst('a');
insertFirst('b');
insertFirst('c');
insertFirst('d');
printList();
insertLast('e');
insertLast('f');
insertAtPos('g',3);
printList();
deleteAtPos(3);
printList();
deleteAtPos(1);
printList();
int pos = search('e');
cout << pos << endl;
pos = search('f');
cout << pos << endl;
return 0;
}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

given the implementation of a singly ( linear ) linked list of character elements Please modify the code as follows. Add a function named "swapLastWithFirst" which swaps the first node with the last...

Q:

given the implementation of a circular linked list of character elements Please modify the code as follows. Add a function named "swapLastWithFirst" which swaps the first node with the last node....

Q:

Please modify the code as follows. 1 . Add a function named "findMin" which finds the minimum value in the list. Thereafter, the "main" function should print the value returned from the "findMin"...

Q:

C++ ..............please..........I know how to do Part A and Part B upto 6 but do know the next steps also I cannot do C and D. Please please do it. Just right the code syntax Assignment 1 Overview...

Q:

In Part A, you will create a type named World to represent the world for the program. You will eventually put the World type and its associated constants and functions in its own module, but for now...

Q:

In Part A, you will create a type named World to represent the world for the program. You will eventually put the World type and its associated constants and functions in its own module, but for now...

Q:

In Part A, you will create a type named World to represent the world for the program. You will eventually put the World type and its associated constants and functions in its own module, but for now...

Q:

Assignment 2 Due February 6, 2018 A simple exploration game such as the one in Assignment 1 may be fun for a short time, but the lack of challenges limits its appeal. The most common solution to this...

Q:

very easy linked list Implementation the given code list.cpp #include #include #include using namespace std; class List; class Iterator; class Node { public: /** Constructs a node with a given data...

Q:

Classes, Prototypes, and NPM modules (Tracker service) Today we looked at how to define and export objects in NodeJS. We covered basic syntax for both ES5- and ES6+ code. While we covered ES5 (and I...

Q:

a. What percentage is the HST of an HST-inclusive price in New Brunswick? b. The total price including HST of an item is $171.35. What is the amount of HST included in the price?

Q:

D'17.33 The circuit of Fig. P17.33 consists of an inverting bistable multivibrator with an output limiter and a nonin- verting integrator. Using equal values for all resistors except R; and a 0.5-nF...

Q:

Explain what would happen if your company were unable to pay its interest expenses out of operating earnings and how that might affect the company s financial distress costs.

Q:

196 kg/h of ground roasted coffee, which contains 8% soluble solids, 2% water, and 90% inert insoluble solids. In order to obtain an extract with high soluble solids content without having to...

Q:

How do Data Types perform data validation?

Q:

How does Referential Integrity work?

Q:

What are Dimensional Relational Databases designed to hold primarily?