Question

Ordered Linked List "Note-Start with a new C++programproject. Insert See page 302 o This section, in the book, shows class object implementation o You are not required to implement as a class/object o You are not required to use the count (linked list counter) In main o Must implement the 4 cases (1,2,3A and 3B) o Run the code to show it willinsertin all four cases insert (first, last,37), ll case l insert (first, last, l4):ll case 2 insert (first, last, 68:llcase 3A insert(first, last, 47:llcase 3B displayList(first: llifyour"insert function works,itwildisplay sorted order Show your work when finished "Although we covered Doubly Linked List today, be sure to re-read "Doubly Linked List" for next Tuesday's class.

How would you get this lab to work with the numbers 37 14 68 47, the book we are using is Data structures using C++ by D.S. Malik. Please I need help? Just keeps repeating the same question.

Code:

#include <iostream>

#include <cstdlib>

using namespace std;

struct nodeType

{

int info;

nodeType *link;

};

void createList(nodeType*& first, nodeType*& last);

void printList(nodeType*& first);

void insertFront(nodeType*& first);

void insertBack(nodeType*& last);

void deleteFirst(nodeType*& first);

void deleteLast(nodeType*& last, nodeType* first);

int main()

{

nodeType *first, *last;

int num;

createList(first, last);

int choice;

while(true)

{

cout<<"1. Insert Front.\n2. Insert Last.\n3. Delete Front.\n4. Delete Last.\n5. Print List.\n6. Exit.\n";

cout<<"Enter your choice: ";

cin>>choice;

switch(choice)

{

case 1:

insertFront(first);

break;

case 2:

insertBack(last);

break;

case 3:

deleteFirst(first);

break;

case 4:

deleteLast(last, first);

break;

case 5:

printList(first);

break;

case 6:

return 0;

default:

cout<<"Invalid menu option. Try again."<<endl;

}

}

system("PAUSE");

return 0;

}

void createList(nodeType*& first, nodeType*& last)

{

int number;

nodeType *newNode;

first = NULL;

last = NULL;

cout<<"Enter an integer (-999 to stop): ";

cin>>number;

while (1)

{

newNode = new nodeType;

// create new node newNode->info = number;

newNode->link = NULL;

cout<<"Enter an integer (-999 to stop): ";

cin>>number;

if(number == -999)

break;

newNode->info = number;

if (first == NULL)

{

first = newNode;

last = newNode;

cout<<"Info "<<first->info;

}

else

{

last->link = newNode;

last = newNode;

}

} // end of while-loop

} // end of build list function

void deleteFirst(nodeType*& first)

{

nodeType *temp;

temp= first;

first= temp->link;

delete temp;

return;

}

void deleteLast(nodeType*& last, nodeType* current)

{

nodeType *temp;

while(current->link != NULL)

{

temp=current;

current=current->link;

}

temp=last;

current->link=NULL;

delete temp;

last = current;

return;

}

void insertFront(nodeType*& front)

{

int num;

cout<<"\n Enter the number to insert: ";

cin>>num;

nodeType *newNode = new nodeType;

newNode->info=num;

newNode->link= front;

front = newNode;

return;

}

void insertBack(nodeType*& last)

{

int num;

cout<<"\n Enter the number to insert: ";

cin>>num;

nodeType *newNode = new nodeType;

newNode->info=num;

newNode->link= NULL;

last->link= newNode;

last = newNode;

return;

}

void printList(nodeType*& first)

{

cout<<"Inside printList...printing linked list...\n"<<endl;

nodeType *current;

current = new nodeType;

current = first;

while (current != NULL)

{

cout << current->info << " ";

current = current->link;

}

cout<<endl;

}

Answer 1

If I understand the question correct, Assignment is on implementation of ordered linked list. In your program, there are no conditions to main the order in linked list. From the assignment description, there should be only insert function. I have modified the program accordingly. Please find below.

Program:

#include <iostream>
#include <cstdlib>
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insert(nodeType*& first, nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
cout<<"Implementation of Ordered Linked List\n Building Linked List.....\n";
createList(first,last);
int choice;
while(true)
{
cout<<"1. Insert.\n2. Delete Front.\n3. Delete Last.\n4. Print List.\n5. Exit.\n";
cout<<"Enter your choice: ";
cin>>choice;
switch(choice)
{
case 1:
insert(first,last);
break;
case 2:
deleteFirst(first);
break;
case 3:
deleteLast(last, first);
break;
case 4:
printList(first);
break;
case 5:
return 0;
default:
cout<<"Invalid menu option. Try again."<<endl;
}
}
system("PAUSE");
return 0;
}
void createList(nodeType*& first, nodeType*& last)
{
int number;
nodeType *newNode,*temp;
first = NULL;
last = NULL;
while (1)
{
newNode = new nodeType;
// create new node newNode->info = number;
newNode->link = NULL;
cout<<"Enter an integer (-999 to stop): ";
cin>>number;
if(number == -999)
break;
newNode->info = number;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else if(newNode->info <= first->info)
{
   newNode->link = first;
   first = newNode;
}
else if(newNode->info > last->info)
{
   last->link= newNode;
last = newNode;
}
else
{
   temp = first;
while(newNode-> info > (temp->link)->info && temp->link!=NULL)
{
   temp=temp->link;
}
newNode->link = temp->link;
temp->link = newNode;
}
} // end of while-loop
} // end of build list function

void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}

void insert(nodeType*& first, nodeType*& last)
{
int number;
nodeType *newNode,*temp;
cout<<"Enter an integer: ";
cin>>number;
newNode = new nodeType;
newNode->info = number;
if(newNode->info <= first->info)
{
   newNode->link = first;
   first = newNode;
}
else if(newNode->info > last->info)
{
   last->link= newNode;
last = newNode;
}
else
{
   temp = first;
while(newNode-> info > (temp->link)->info && temp->link!=NULL)
{
   temp=temp->link;
}
newNode->link = temp->link;
temp->link = newNode;
}
return;
}

void printList(nodeType*& first)
{
cout<<"Inside printList...printing linked list...\n"<<endl;
nodeType *current;
current = new nodeType;
current = first;
while (current != NULL)
{
cout << current->info << " ";
current = current->link;
}
cout<<endl;
}

Output:

If you find the answer useful, kindly upvote.