Question
need .cpp file for BSTree using c++ // // Laboratory 9 BSTree.h // // Class declarations for the linked implementation of the Binary // Search
need .cpp file for BSTree using c++ // // Laboratory 9 BSTree.h // // Class declarations for the linked implementation of the Binary // Search Tree ADT -- including the recursive helpers of the // public member functions // //--------------------------------------------------------------------
#ifndef BSTREE_H #define BSTREE_H
#include
using namespace std;
template < typename DataType, class KeyType > // DataType : tree data item class BSTree // KeyType : key field { public:
// Constructor BSTree (); // Default constructor BSTree ( const BSTree
// Destructor ~BSTree ();
// Binary search tree manipulation operations void insert ( const DataType& newDataItem ); // Insert data item bool retrieve ( const KeyType& searchKey, DataType& searchDataItem ) const; // Retrieve data item bool remove ( const KeyType& deleteKey ); // Remove data item void writeKeys () const; // Output keys void clear (); // Clear tree
// Binary search tree status operations bool isEmpty () const; // Tree is empty // !! isFull() has been retired. Not very useful in a linked structure.
// Output the tree structure -- used in testing/debugging void showStructure () const;
// In-lab operations int getHeight () const; // Height of tree int getCount () const; // Number of nodes in tree void writeLessThan ( const KeyType& searchKey ) const; // Output keys < searchKey
protected:
class BSTreeNode // Inner class: facilitator for the BSTree class { public: // Constructor BSTreeNode ( const DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode *rightPtr );
// Data members DataType dataItem; // Binary search tree data item BSTreeNode *left, // Pointer to the left child *right; // Pointer to the right child };
// Recursive helpers for the public member functions -- insert // prototypes of these functions here. void showHelper ( BSTreeNode *p, int level ) const;
// Data member BSTreeNode *root; // Pointer to the root node };
#endif // define BSTREE_H
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started