Question

I need the following code completed:

#include <iostream>
#include <time.h>

#include "CSVparser.hpp"

using namespace std;

//============================================================================
// Global definitions visible to all methods and classes
//============================================================================

// forward declarations
double strToDouble(string str, char ch);

// define a structure to hold bid information
struct Bid {
string bidId; // unique identifier
string title;
string fund;
double amount;
Bid() {
amount = 0.0;
}
};

// FIXME (1): Internal structure for tree node
struct Node {
   Bid data; Node *left; Node *right;
};

//============================================================================
// Binary Search Tree class definition
//============================================================================

/**
* Define a class containing data members and methods to
* implement a binary search tree
*/
class BinarySearchTree {

private:
Node* root;

void addNode(Node* node, Bid bid);
void inOrder(Node* node);
Node* removeNode(Node* node, string bidId);

public:
BinarySearchTree();
virtual ~BinarySearchTree();
void InOrder();
void Insert(Bid bid);
void Remove(string bidId);
Bid Search(string bidId);
};

/**
* Default constructor
*/
BinarySearchTree::BinarySearchTree() {
// initialize housekeeping variables
}

/**
* Destructor
*/
BinarySearchTree::~BinarySearchTree() {
// recurse from root deleting every node
}

/**
* Traverse the tree in order
*/
void BinarySearchTree::InOrder() {
}
/**
* Insert a bid
*/
void BinarySearchTree::Insert(Bid bid) {
   Node p = Insert(root, bid);
   p->data.bidId = bid.bidId;
   p->data.title = bid.title;
   p->data.fund = bid.fund;
   p->data.amount = bid.amount;
}

/**
* Remove a bid
*/
void BinarySearchTree::Remove(string bidId) {
   deleteNode(root,bidid);
}

/**
* Search for a bid
*/
Bid BinarySearchTree::Search(string bidId) {
// FIXME (3) Implement searching the tree for a bid

   Bid bid;
   if (root == NULL || root->data.bidId == bidId) {
   bid.bidId = bidId;
   bid.title = root->data.title;
   bid.fund = root->data.fund;
   bid.amount = root->data.amount;
   return bid;
   }

   if (root->data.bidId < bidId)
   return search(root->right, bidId);

   return search(root->left, bidId);
return bid;
}

/**
* Add a bid to some node (recursive)
*
* @param node Current node in tree
* @param bid Bid to be added
*/
void BinarySearchTree::addNode(Node* node, Bid bid) {
// FIXME (2b) Implement inserting a bid into the tree
   Node p = insertNode(node, bid);
   p->data.bidId = bid.bidId;
   p->data.title = bid.title;
   p->data.fund = bid.fund;
   p->data.amount = bid.amount;
}
void BinarySearchTree::inOrder(Node* node) {
}
//============================================================================
// Static methods used for testing
//============================================================================

/**
* Display the bid information to the console (std::out)
*
* @param bid struct containing the bid info
*/
void displayBid(Bid bid) {
cout << bid.bidId << ": " << bid.title << " | " << bid.amount << " | "
<< bid.fund << endl;
return;
}

/**
* Load a CSV file containing bids into a container
*
* @param csvPath the path to the CSV file to load
* @return a container holding all the bids read
*/
void loadBids(string csvPath, BinarySearchTree* bst) {
cout << "Loading CSV file " << csvPath << endl;

// initialize the CSV Parser using the given path
csv::Parser file = csv::Parser(csvPath);

// read and display header row - optional
vector<string> header = file.getHeader();
for (auto const& c : header) {
cout << c << " | ";
}
cout << "" << endl;

try {
// loop to read rows of a CSV file
for (unsigned int i = 0; i < file.rowCount(); i++) {

// Create a data structure and add to the collection of bids
Bid bid;
bid.bidId = file[i][1];
bid.title = file[i][0];
bid.fund = file[i][8];
bid.amount = strToDouble(file[i][4], '$');

//cout << "Item: " << bid.title << ", Fund: " << bid.fund << ", Amount: " << bid.amount << endl;

// push this bid to the end
bst->Insert(bid);
}
} catch (csv::Error &e) {
std::cerr << e.what() << std::endl;
}
}

/**
* Simple C function to convert a string to a double
* after stripping out unwanted char
*
* credit: http://stackoverflow.com/a/24875936
*
* @param ch The character to strip out
*/
double strToDouble(string str, char ch) {
str.erase(remove(str.begin(), str.end(), ch), str.end());
return atof(str.c_str());
}

/**
* The one and only main() method
*/
int main(int argc, char* argv[]) {

// process command line arguments
string csvPath, bidKey;
switch (argc) {
case 2:
csvPath = argv[1];
bidKey = "98109";
break;
case 3:
csvPath = argv[1];
bidKey = argv[2];
break;
default:
csvPath = "eBid_Monthly_Sales_Dec_2016.csv";
bidKey = "98109";
}

// Define a timer variable
clock_t ticks;

// Define a binary search tree to hold all bids
BinarySearchTree* bst;

Bid bid;

int choice = 0;
while (choice != 9) {
cout << "Menu:" << endl;
cout << " 1. Load Bids" << endl;
cout << " 2. Display All Bids" << endl;
cout << " 3. Find Bid" << endl;
cout << " 4. Remove Bid" << endl;
cout << " 9. Exit" << endl;
cout << "Enter choice: ";
cin >> choice;

switch (choice) {

case 1:
bst = new BinarySearchTree();

// Initialize a timer variable before loading bids
ticks = clock();

// Complete the method call to load the bids
loadBids(csvPath, bst);

//cout << bst->Size() << " bids read" << endl;

// Calculate elapsed time and display result
ticks = clock() - ticks; // current clock ticks minus starting clock ticks
cout << "time: " << ticks << " clock ticks" << endl;
cout << "time: " << ticks * 1.0 / CLOCKS_PER_SEC << " seconds" << endl;
break;

case 2:
bst->InOrder();
break;

case 3:
ticks = clock();

bid = bst->Search(bidKey);

ticks = clock() - ticks; // current clock ticks minus starting clock ticks

if (!bid.bidId.empty()) {
displayBid(bid);
} else {
   cout << "Bid Id " << bidKey << " not found." << endl;
}

cout << "time: " << ticks << " clock ticks" << endl;
cout << "time: " << ticks * 1.0 / CLOCKS_PER_SEC << " seconds" << endl;

break;

case 4:
bst->Remove(bidKey);
break;
}
}

cout << "Good bye." << endl;

   return 0;
}

Answer 1

Code:-

main.cpp

#include <algorithm>
#include <iostream>
#include <time.h>
#include <string>

#include "CSVparser.hpp"

using namespace std;

//============================================================================
// Global definitions visible to all methods and classes
//============================================================================

// forward declarations
double strToDouble(string str, char ch);

// define a structure to hold bid information
struct Bid {
string bidId; // unique identifier
string title;
string fund;
double amount;
Bid() {
amount = 0.0;
}
};

// FIXME (1): Internal structure for tree node
struct Node {
Bid bid;
Node* parentPtr;
Node* leftPtr;
Node* rightPtr;
};

//============================================================================
// Binary Search Tree class definition
//============================================================================

/**
* Define a class containing data members and methods to
* implement a binary search tree
*/
class BinarySearchTree {

private:
Node* root;

void addNode(Node* node, Bid bid);
void inOrder(Node* node);
Node* removeNode(Node* node, string bidId);

public:
BinarySearchTree();
virtual ~BinarySearchTree();
void InOrder();
void Insert(Bid bid);
void Remove(string bidId);
Bid Search(string bidId);
Node* SearchNode(Node* node, string bidId);
};

/**
* Default constructor
*/
BinarySearchTree::BinarySearchTree() {
// initialize housekeeping variables
root = nullptr;
}

/**
* Destructor
*/
BinarySearchTree::~BinarySearchTree() {
// recurse from root deleting every node
}

/**
* Traverse the tree in order
*/
void BinarySearchTree::InOrder() {
}
/**
* Insert a bid
*/
void BinarySearchTree::Insert(Bid bid) {

if (root == nullptr) {
root = new Node;
root->bid = bid;
root->leftPtr = nullptr;
root->rightPtr = nullptr;
root->parentPtr = nullptr;
} else {
addNode(root, bid);
}

}

/**
* Remove a bid
*/
void BinarySearchTree::Remove(string bidId) {
// FIXME (4a) Implement removing a bid from the tree
Node* nodePtr = SearchNode(root, bidId);
if (nodePtr == nullptr) {
return;
} else {
nodePtr->parentPtr->leftPtr = nodePtr->leftPtr;
nodePtr->parentPtr->rightPtr = nodePtr->rightPtr;
nodePtr->leftPtr->parentPtr = nodePtr->parentPtr;
nodePtr->rightPtr->parentPtr = nodePtr->parentPtr;
delete nodePtr;
}
}

/**
* Search for a bid
*/
Bid BinarySearchTree::Search(string bidId) {
// FIXME (3) Implement searching the tree for a bid
Node* nodePtr = SearchNode(root, bidId);
if (nodePtr == nullptr) {
Bid bid;
return bid;
} else {
return nodePtr->bid;
}
Bid bid;
return bid;
}

/**
* New function to search recursively for bidId/key within search tree
*/

Node* BinarySearchTree::SearchNode (Node* node, string bidId) {
if (node == nullptr) {
return nullptr;
} else {
if (node->bid.bidId == bidId) {
return node;
} else {
int curKey = atoi(node->bid.bidId.c_str());
int key = atoi(bidId.c_str());
if (key > curKey) {
return SearchNode(node->rightPtr, bidId);
} else {
return SearchNode(node->leftPtr, bidId);
}
}
}
return nullptr;
}

/**
* Add a bid to some node (recursive)
*
* @param node Current node in tree
* @param bid Bid to be added
*/
void BinarySearchTree::addNode(Node* node, Bid bid) {
// FIXME (2b) Implement inserting a bid into the tree
int curKey = atoi(node->bid.bidId.c_str());
int key = atoi(bid.bidId.c_str());

cout << "Current key is: " << curKey << endl;
cout << "Search key is: " << key << endl;

if (key > curKey) {
if (node->rightPtr == nullptr) {
node->rightPtr = new Node;
node->rightPtr->bid = bid;
node->rightPtr->rightPtr = nullptr;
node->rightPtr->leftPtr = nullptr;
node->rightPtr->parentPtr = node;
} else {
addNode(node->rightPtr, bid);
}
} else {
if (node->leftPtr == nullptr) {
node->leftPtr = new Node;
node->leftPtr->bid = bid;
node->leftPtr->rightPtr = nullptr;
node->leftPtr->leftPtr = nullptr;
node->leftPtr->parentPtr = node;

cout << "leftPtr is nullptr" << endl;
} else {

cout << "leftPtr is NOT nullptr" << endl;
addNode(node->leftPtr, bid);
}
}
}
void BinarySearchTree::inOrder(Node* node) {
}
//============================================================================
// Static methods used for testing
//============================================================================

/**
* Display the bid information to the console (std::out)
*
* @param bid struct containing the bid info
*/
void displayBid(Bid bid) {
cout << bid.bidId << ": " << bid.title << " | " << bid.amount << " | "
<< bid.fund << endl;
return;
}

/**
* Load a CSV file containing bids into a container
*
* @param csvPath the path to the CSV file to load
* @return a container holding all the bids read
*/
void loadBids(string csvPath, BinarySearchTree* bst) {
cout << "Loading CSV file " << csvPath << endl;

// initialize the CSV Parser using the given path
csv::Parser file = csv::Parser(csvPath);

// read and display header row - optional
vector<string> header = file.getHeader();
for (auto const& c : header) {
cout << c << " | ";
}
cout << "" << endl;

try {
// loop to read rows of a CSV file
for (unsigned int i = 0; i < file.rowCount(); i++) {

// Create a data structure and add to the collection of bids
Bid bid;
bid.bidId = file[i][1];
bid.title = file[i][0];
bid.fund = file[i][8];
bid.amount = strToDouble(file[i][4], '$');

//cout << "Item: " << bid.title << ", Fund: " << bid.fund << ", Amount: " << bid.amount << endl;

// push this bid to the end
bst->Insert(bid);
}
} catch (csv::Error &e) {
std::cerr << e.what() << std::endl;
}
}

double strToDouble(string str, char ch) {
str.erase(remove(str.begin(), str.end(), ch), str.end());
return atof(str.c_str());
}

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

// process command line arguments
string csvPath, bidKey;
switch (argc) {
case 2:
csvPath = argv[1];
bidKey = "98105";
break;
case 3:
csvPath = argv[1];
bidKey = argv[2];
break;
default:
csvPath = "eBid_Monthly_Sales_Dec_2016.csv";
bidKey = "98105";
}

// Define a timer variable
clock_t ticks;

// Define a binary search tree to hold all bids
BinarySearchTree* bst;

Bid bid;

int choice = 0;
while (choice != 9) {
cout << "Menu:" << endl;
cout << " 1. Load Bids" << endl;
cout << " 2. Display All Bids" << endl;
cout << " 3. Find Bid" << endl;
cout << " 4. Remove Bid" << endl;
cout << " 9. Exit" << endl;
cout << "Enter choice: ";
cin >> choice;

switch (choice) {

case 1:
bst = new BinarySearchTree();

// Initialize a timer variable before loading bids
ticks = clock();

// Complete the method call to load the bids
loadBids(csvPath, bst);

//cout << bst->Size() << " bids read" << endl;

// Calculate elapsed time and display result
ticks = clock() - ticks; // current clock ticks minus starting clock ticks
cout << "time: " << ticks << " clock ticks" << endl;
cout << "time: " << ticks * 1.0 / CLOCKS_PER_SEC << " seconds" << endl;
break;

case 2:
bst->InOrder();
break;

case 3:
ticks = clock();

bid = bst->Search(bidKey);

ticks = clock() - ticks; // current clock ticks minus starting clock ticks

if (!bid.bidId.empty()) {
displayBid(bid);
} else {
cout << "Bid Id " << bidKey << " not found." << endl;
}

cout << "time: " << ticks << " clock ticks" << endl;
cout << "time: " << ticks * 1.0 / CLOCKS_PER_SEC << " seconds" << endl;

break;

case 4:
bst->Remove(bidKey);
break;
}
}

cout << "Good bye." << endl;

return 0;
}

P.s - save the main.cpp , CSVparser.hpp and eBid_Monthly_Sales_Dec_2016.csv in same folder or it will give errors.

if u like my answer then please give a thums up..!!