Question

Please use C++

CS3358 Insert and delete a node Programming Project 2: The linked list - Reference: chapter 18: Create an array of 15 student records that should not be sorted Create a liked list of 15 student record nodes. Each node is a node of one student record from the above unsorted array. The list of student records should be sorted by student ID. (Insert function without sort function to create a linked list.) (If you insert correctly, the resulting linked list is sorted.) Each student record consists of student ID, student name, Student address, and GPA. The student records must be defined as student object class with member functions. (No class definition declaration will be no credit for the project.) Turn in source programs and Execution output: Display the student records from the unsorted array 2.Display the student records from the linked list (Display function)

Answer 1

Program

#include <iostream>
#include <string>
#include <fstream>
#include <stdlib.h>
#include <iomanip>

using namespace std;

//student class
class Student
{
   public:
   int id;
   string name;
   string address;
   float gpa;
};

class StudentNode
{
   public:
   Student student;
   StudentNode *next;
};

//declare head node
StudentNode *head=NULL;

//function to insert a node
void insert(Student std)
{
   StudentNode *temp, *prev;
  
   //create a new node
   StudentNode *newnode = new StudentNode;

   //fill with data
   newnode->student = std;
   newnode->next=NULL;
  
   //check list is empty or not
   if(head==NULL)
   {
       head = newnode;
   }
   else
   {
       temp = head;
       while(temp->student.id < newnode->student.id)
       {
           prev = temp;
           temp = temp->next;
           if(temp==NULL) break;
       }
      
       newnode->next = temp;
       //check insert before the head node or not
       if(temp==head)
       {
           head = newnode;
           return;
       }
        prev->next=newnode;
   }
}

//function to delete kth node
void deleteNode(int k)
{
   StudentNode *temp, *prev, *nextnode;
  
   //check list is empty or not
   if(head==NULL)
   {
       cout << "Student List is empty! " << endl;
       return;
   }
   else
   {
       temp = head;
       for(int i=1; i<k; i++)
       {
           prev = temp;
           temp = temp->next;
       }
      
       nextnode = temp->next;
      
       prev->next = nextnode;
      
       temp->next = NULL;
       delete temp;
   }
}

//function to display the student list
void display()
{
   StudentNode *temp;
   temp = head;
  
   cout<<"ID       Name       Address       GPA"<<endl;
   while(temp!=NULL)
   {
       cout<<"__________________________________________________________"<<endl;
       cout<<"| ";
       cout<<left<<setfill(' ')<<setw(10)<<temp->student.id;
       cout<<setw(5)<<"| ";
       cout<<left<<setfill(' ')<<setw(10)<<temp->student.name;
       cout<<setw(5)<<"| ";
       cout<<left<<setfill(' ')<<setw(10)<<temp->student.address;
       cout<<setw(5)<<"| ";
       cout<<left<<setfill(' ')<<setw(10)<<temp->student.gpa;
       cout<<" |"<<endl;
       temp = temp->next;
   }
   cout<<"__________________________________________________________"<<endl;  
}

//main function
int main()
{
   const int MAX = 15;
   Student std[MAX], tmp;
   int k;

   for(int i=0; i<MAX; i++)
   {
       cout <<"Enter ID: ";
       cin >> std[i].id;
       cout <<"Enter NAME: ";
       cin >> std[i].name;
       cout <<"Enter ADDRESS: ";
       cin >> std[i].address;
       cout <<"Enter GPA: ";
       cin >> std[i].gpa;  
   }
  
   for(int i=0; i<MAX; i++)
   {
       insert(std[i]);
   }
  
   display();
  
   cout << "\nEnter the k for delete kth node :";
   cin >> k;
  
   deleteNode(k);
  
   cout << "After deletion: "<< endl;
   display();
  
   cout << "\nEnter a node for insert :" << endl;
   cout <<"Enter ID: ";
   cin >> tmp.id;
   cout <<"Enter NAME: ";
   cin >> tmp.name;
   cout <<"Enter ADDRESS: ";
   cin >> tmp.address;
   cout <<"Enter GPA: ";
   cin >> tmp.gpa;  
  
   insert(tmp);
  
   cout << "After insertion: "<< endl;
   display();
      
   return 0;
}

Sample Output: