Question

Hi there, I am working on a binary search tree code in c++. The program must store and update students' academic records, each node includes the student name, credits attempted, credits earned and GPA. I have made some progress with the code and written most of the functions in the .cpp file (already did the .h file) but i am struggling with what to put in the main and how to put an update part in the insert function. I know I need a switch statement to substitute the letter grades for the quality points but i am not sure if that should go in main or in the insert function in the .cpp file .. this is what I have so far .. thanks!!

// Implementation file for the StudentRecordsTree class
#include <iostream>
#include "StudentRecordsTree.h"
using namespace std;

//*************************************************************
// insert accepts a TreeNode pointer and a pointer to a node. *
// The function inserts the node into the tree pointed to by *
// the TreeNode pointer. This function is called recursively. *
//*************************************************************

void StudentRecordsTree::insert(TreeNode *&nodePtr, TreeNode *&newNode)
{
  
if (nodePtr == nullptr)
nodePtr = newNode; // Insert the node.
else if (newNode->Name < nodePtr->Name) //if name comes before orig name
insert(nodePtr->left, newNode); // Search the left branch
else //if name comes after orig name
insert(nodePtr->right, newNode); // Search the right branch
}

//**********************************************************
// insertNode creates a new node to hold num as its value, *
// and passes it to the insert function. *
//**********************************************************

void StudentRecordsTree::insertNode(string name, int credits, char grade)
{
  
TreeNode *newNode = nullptr;   // Pointer to a new node.
//bool isFound = true;
//if(!isFound){
// Create a new node and store name in it.
newNode = new TreeNode;
//newNode->Name = name;
//newNode->creditsAtt = creditsAtt;

newNode->left = newNode->right = nullptr;
// Insert the node. & call private insert function above
insert(root, newNode);

switch (grade){
case 'A':
cout << 4 << endl;
case 'B':
cout << 3 << endl;
case 'C':
cout << 2 << endl;
case 'D':
cout << 1 << endl;
case 'F':
cout << 0 << endl;
}
  
}

//***************************************************
// destroySubTree is called by the destructor. It *
// deletes all nodes in the tree. *
//***************************************************

void StudentRecordsTree::destroySubTree(TreeNode *nodePtr)
{
if (nodePtr)
{
if (nodePtr->left)
destroySubTree(nodePtr->left);
if (nodePtr->right)
destroySubTree(nodePtr->right);
delete nodePtr;
}
}
//****************************************************************
// The displayInOrder member function displays the values *
// in the subtree pointed to by nodePtr, via inorder traversal. *
//****************************************************************

void StudentRecordsTree::displayInOrder(TreeNode *nodePtr) const
{
if (nodePtr)
{
displayInOrder(nodePtr->left);
cout << nodePtr->Name << endl;
displayInOrder(nodePtr->right);
}
}

//****************************************************************
// The displayPreOrder member function displays the values *
// in the subtree pointed to by nodePtr, via preorder traversal. *
//****************************************************************

void StudentRecordsTree::displayPreOrder(TreeNode *nodePtr) const
{
if (nodePtr)
{
cout << nodePtr->Name << endl;
displayPreOrder(nodePtr->left);   
displayPreOrder(nodePtr->right);
}
}

//****************************************************************
// The displayPostOrder member function displays the values *
// in the subtree pointed to by nodePtr, via postorder traversal.*
//****************************************************************

void StudentRecordsTree::displayPostOrder(TreeNode *nodePtr) const
{
if (nodePtr)
{
displayPostOrder(nodePtr->left);
displayPostOrder(nodePtr->right);
cout << nodePtr->Name << endl;
}
}
/*int PrintMax(Node *root)
{
if (!root)
return 0; // Only if the tree contains nothing at all

//right most node has max value so search till u hit right most node
if (root->right)
return PrintMax(root->right);
cout << "max value = " << root->data;
}

#include <cstdlib>
#include <iostream>
#include <fstream>
#include"StudentRecordsTree.h"
using namespace std;

int main(int argc, char** argv) {

StudentRecordsTree tree; //instance of StudentRecordsTree class
string k;
int credits;
char grade;
  
//open output file
ofstream outFile;
outFile.open("output.txt");
  
ifstream inFile;
inFile.open("Student.txt");
string temp;
  
//insert student records one by one,
//if it already exists, update

  
  
  
for(int i=0; i < 50; i++){
//if(getline(inFile,k))
while(inFile >> k >> credits >> grade)
{

tree.insertNode(k,credits,grade);
  
}
}
  
//while(inFile >> k >> credits >> grade)
//{
// cout << k << " " << credits << " " << grade << endl;
//}
tree.displayInOrder();
  
  
  
return 0;
  
}

#ifndef STUDENTRECORDS_H
#define   STUDENTRECORDS_H
#include<cstdlib>
#include <string>

class StudentRecordsTree
{
private:
struct TreeNode
{
std::string Name; // key value
int creditsAtt;
int creditsEarn;
double gpa;
TreeNode *left; // Pointer to left child node
TreeNode *right; // Pointer to right child node
};

TreeNode *root; // Pointer to the root node
TreeNode element;

// Private member functions
void insert(TreeNode *&, TreeNode *&);
void destroySubTree(TreeNode *);
void deleteNode (std::string, TreeNode *&);
void displayInOrder(TreeNode *) const;
void displayPreOrder(TreeNode *) const;
void displayPostOrder(TreeNode *) const;

public:
// Constructor
StudentRecordsTree()
{ root = nullptr; }
  
// Destructor
~StudentRecordsTree()
{ destroySubTree(root); }
  
// Binary tree operations
void insertNode(std::string, int, char);
void displayInOrder() const
{ displayInOrder(root); }
void displayPreOrder() const
{ displayPreOrder(root); }
void displayPostOrder() const
{ displayPostOrder(root); }

};
#endif   /* STUDENTRECORDS_H */

Jones,Sue,        3B
Brown,Charlie        3D
Smith,John       3C
Smith,John       4C
Bird,Sam       2C
Bird,Sam       2C
Smith,John       5C
Jones,Sue       3A
Moose,Manny       3A
Bear,Ben       4C
Bear,Ben       5F
Bear,Ben       2C
Brown,Charlie        3C  

^that is the input file

Answer 1

升.de. Sine g7m g1 REC Nade.* r2 find No .de 벙 VaLe Cv.): es,

nRL