C++ Programming. Please only answer if you can do the ENTIRE problem. Make the f

ID: 3852994 • Letter: C

Question

C++ Programming. Please only answer if you can do the ENTIRE problem. Make the files copyable with a screenshot of the output. All code is listed below just complete the To Do parts. Really appreciate it, can't wait to give you a thumbs up for your work :-)

To Do:

- using the linked approach implement the BST ADT, implement all the functions in the BSTree.cpp. (60 points)

- use recursive functions to traverse the tree - read the implementation notes on using helper functions.

- Programming Exercise 2 (20 points)

- Programming Exercise 3 (20 points)

test9.cpp:

//--------------------------------------------------------------------

// Laboratory 9 test9.cpp

// Test program for the operations in the Binary Search Tree ADT

//--------------------------------------------------------------------

#include <iostream>

using namespace std;

#include "BSTree.cpp"

#include "config.h"

void print_help();

//--------------------------------------------------------------------

// Declaration for the binary search tree data item class

//--------------------------------------------------------------------

class TestData

{

public:

void setKey ( int newKey )

{ keyField = newKey; } // Set the key

int getKey () const

{ return keyField; } // Returns the key

private:

int keyField; // Key for the data item

};

int main()

{

BSTree<TestData,int> testTree; // Test binary search tree

TestData testData; // Binary search tree data item

int inputKey; // User input key

char cmd; // Input command

print_help();

{

testTree.showStructure(); // Output tree

cout << endl << "Command: "; // Read command

cin >> cmd;

if ( cmd == '+' || cmd == '?' ||

cmd == '-' || cmd == '<' )

cin >> inputKey;

switch ( cmd )

{

case 'P' : case 'p' :

print_help();

break;

case '+' : // insert

testData.setKey(inputKey);

cout << "Insert : key = " << testData.getKey()

<< endl;

testTree.insert(testData);

break;

case '?' : // retrieve

if ( testTree.retrieve(inputKey,testData) )

cout << "Retrieved : getKey = "

<< testData.getKey() << endl;

else

cout << "Not found" << endl;

break;

case '-' : // remove

if ( testTree.remove(inputKey) )

cout << "Removed data item" << endl;

else

cout << "Not found" << endl;

break;

case 'K' : case 'k' : // writeKeys

cout << "Keys:" << endl;

testTree.writeKeys();

break;

case 'C' : case 'c' : // clear

cout << "Clear the tree" << endl;

testTree.clear();

break;

case 'E' : case 'e' : // empty

if ( testTree.isEmpty() )

cout << "Tree is empty" << endl;

else

cout << "Tree is NOT empty" << endl;

break;

#if LAB9_TEST1

case 'G' : case 'g' : // Programming Exercise 2

cout << "Tree nodes count = " << testTree.getCount() << endl;

break;

#endif // LAB9_TEST1

#if LAB9_TEST2

case 'H' : case 'h' : // Programming Exercise 2

cout << "Tree height = " << testTree.getHeight() << endl;

break;

#endif // LAB9_TEST2

#if LAB9_TEST3

case '<' : // Programming Exercise 3

cout << "Keys < " << inputKey << " : " << endl;

testTree.writeLessThan(inputKey);

cout << endl;

break;

#endif // LAB9_TEST3

case 'Q' : case 'q' : // Quit test program

break;

default : // Invalid command

cout << "Inactive or invalid command. 'P' prints help." << endl;

}

while ( cin && ( cmd != 'Q' ) && ( cmd != 'q' ) );

if ( !cin ) {

cerr << "Error in console input. Exiting." << endl;

}

return 0;

}

//--------------------------------------------------------------------

void print_help() {

cout << endl << "Commands:" << endl;

cout << " P : [P]rint Help (displays this message)" << endl;

cout << " +key : Insert (or update) data item (use integers)" << endl;

cout << " ?key : Retrieve data item" << endl;

cout << " -key : Remove data item" << endl;

cout << " K : Write keys in ascending order" << endl;

cout << " C : Clear the tree" << endl;

cout << " E : Empty tree?" << endl;

cout << " G : Get count of nodes "

#if LAB9_TEST1

<< "(Active : "

#else

<< "(Inactive : "

#endif

<< "In-lab Exercise 2)" << endl;

cout << " H : Height "

#if LAB9_TEST2

<< "(Active : "

#else

<< "(Inactive : "

#endif

<< "In-lab Exercise 2)" << endl;

cout << " <key : Write keys that are < key "

#if LAB9_TEST3

<< "(Active : "

#else

<< "(Inactive : "

#endif

<< "In-lab Exercise 3)" << endl;

cout << " Q : Quit the test program" << endl;

cout << endl;

}

show9.cpp:

#include "BSTree.h"

//--------------------------------------------------------------------

// Laboratory 9 show9.cpp

// Linked implementation of the showStructure operation for the

// Binary Search Tree ADT

//--------------------------------------------------------------------

template < typename DataType, typename KeyType >

void BSTree<DataType,KeyType>:: showStructure () const

// Outputs the keys in a binary search tree. The tree is output

// rotated counterclockwise 90 degrees from its conventional

// orientation using a "reverse" inorder traversal. This operation is

// intended for testing and debugging purposes only.

{

if ( root == 0 )

cout << "Empty tree" << endl;

else

{

cout << endl;

showHelper(root,1);

cout << endl;

}

// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template < typename DataType, typename KeyType >

void BSTree<DataType,KeyType>:: showHelper ( BSTreeNode *p,

int level ) const

// Recursive helper for showStructure.

// Outputs the subtree whose root node is pointed to by p.

// Parameter level is the level of this node within the tree.

{

int j; // Loop counter

if ( p != 0 )

{

showHelper(p->right,level+1); // Output right subtree

for ( j = 0 ; j < level ; j++ ) // Tab over to level

cout << " ";

cout << " " << p->dataItem.getKey(); // Output key

if ( ( p->left != 0 ) && // Output "connector"

( p->right != 0 ) )

cout << "<";

else if ( p->right != 0 )

cout << "/";

else if ( p->left != 0 )

cout << "\";

cout << endl;

showHelper(p->left,level+1); // Output left subtree

}

BSTree.cpp:

#include "BSTree.h"

template <typename DataType, class KeyType>

BSTree<DataType, KeyType>::BSTreeNode::BSTreeNode ( const DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode *rightPtr )

{

}