Program Assignment 6 Starter Code

*/

#include <iostream>
using namespace std;

#include <stdio.h>

struct Person
{
string id;
string name;
int balance;
};

struct Node
{
Person* data;
Node* next;
};

//Inputs information for one person
//Returns NULL if an empty string is entered
//for id.
Person* getPerson( )
{

string id, dummy;

//Enter the first value
cout << "Enter ID (Enter return to stop): ";
getline(cin,id);

if (id.length() == 0)
{
   return NULL;
}

Person* p = new Person;

p->id = id;

//Enter the remaining two info
cout << "Enter name: ";
getline(cin,p->name); //accept white spaces as part of input data

cout << "Enter balance: ";
cin >> p->balance;

getline(cin,dummy); //remove the newline char from the input stream

return p;
}

/*

This function creates a linked list of nodes
from user input. It does not perform any input
checking such as duplicate id. This function
is for illustration only, to show an
example of creating a linked list of nodes

THIS IS FOR ILLUSTRATION ONLY. YOU DO NOT USE
THIS FUNCTION FROM ANY OF THE FOUR FUNCTIONS
YOU IMPLEMENT. You may use this function from
your test main.

*/

Node* createList( )
{

Node* L;
Node* tail;
Person* p;

L = NULL;

//Get the first person
p = getPerson();

if (p == NULL) return L;

L = new Node;
L->data = p;
L->next = NULL;

tail = L; //tail points to the last node

while (true)
{

   p = getPerson();

   if (p == NULL) return L;

   tail->next = new Node;

   tail = tail->next;

   tail->data = p;
   tail->next = NULL;
}
}

/*
Display the data of the Person struct

YOU DO NOT USE
THIS FUNCTION FROM ANY OF THE FOUR FUNCTIONS
YOU IMPLEMENT. You may use this function from
your test main.
*/
void display(Person* p)
{

printf("%8s %-18s%4d\n", p->id.c_str(), p->name.c_str(), p->balance);

//Note: printf does not accept a variable of C++ string type.
//    You need to pass C array of char. The method c_str() converts
// C++ string to a C array of char

}

//FUNCTION 1: Add new member to the list L
//
bool add(Node*& L, Person* newmember)
{
if (L == NULL)
{
   L = new Node;
   L->data = newmember;
   L->next = NULL;
   return true;
}
Node* current = L;
while (true)
{
   if (current->data->id == newmember->id

Read the file with grades and do the following: Write a loop to:...