Help with codes and using C++ I will appreciate it and thumbs up // Templated binary search tree template class BST { friend class DSA_TestSuite_Lab7; // Giving access to test code struct Node { Type data; // The value being stored Node* left, * right; // The left and right nodes Node* parent; // The parent node // Constructor // Always creates a leaf node // // In: _data The value to store in this node // _parent The parent pointer (optional) Node(const Type& _data, Node* _parent = nullptr) { // TODO: Implement this method } }; // Data members Node* mRoot; // The top-most Node in the tree public: // Default constructor // Always creates an empty tree BST() { // TODO: Implement this method } // Destructor // Clear all dynamic memory ~BST() { // TODO: Implement this method } // Copy constructor // Used to initialize one object to another // // In: _copy The object to copy from BST(const BST& _copy) { // TODO: Implement this method } // Assignment operator // Used to assign one object to another // // In: _assign The object to assign from // // Return: The invoking object (by reference) // This allows us to daisy-chain BST& operator=(const BST& _assign) { // TODO: Implement this method } private: // Recursive helper method for use with Rule of 3 // // In: _curr The current Node to copy // // NOTE: Use pre-order traversal void Copy(const Node* _curr) { // TODO: Implement this method } public: // Clears out the tree and readies it for re-use void Clear() { // TODO: Implement this method } private: // Recursive helper method for use with Clear // // In: _curr The current Node to clear // // NOTE: Use post-order traversal void Clear(Node* _curr) { // TODO: Implement this method } public: // Add a value into the tree // // In: _val The value to add void Push(const Type& _val) { // TODO: Implement this method } private: // Optional recursive helper method for use with Push // // In: _val The value to add // _curr The current Node being looked at void Push(const Type& _val, Node* _curr, Node* _parent) { // TODO: Implement this method (Optional) } public: // Checks to see if a value is in the tree // // In: _val The value to search for // // Return: True, if found bool Contains(const Type& _val) { // TODO: Implement this method } private: // Optional helper method for use with Contains and Remove methods // // In: _val The value to search for // // Return: The node containing _val (or nullptr if not found) Node* FindNode(const Type& _val) { // TODO: Implement this method (Optional) } // Remove a leaf node from the tree // Case 0 // // In: _node The Case 0 node to remove // // Note: The node being passed in will always be a Case 0 // Remember to check all 3 subcases // 1. Root only // 2. Left leaf node // 3. Right leaf node void RemoveCase0(Node* _node) { // TODO: Implement this method } // Remove a node from the tree that has only one child // Case 1 // // In: _node The Case 1 node to remove // // Note: The node being passed in will always be a Case 1 // Remember to check all 6 subcases // 1. Root with left child // 2. Root with right child // 3. Left node with left child // 4. Left node with right child // 5. Right node with left child // 6. Right node with right child void RemoveCase1(Node* _node) { // TODO: Implement this method } // Remove a node from the tree that has both children // Case 2 // // In: _node The Case 2 node to remove // // Note: The node being passed in will always be a Case 2 void RemoveCase2(Node* _node) { // TODO: Implement this method } public: // Removes a value from tree (first instance only) // // In: _val The value to search for // // Return: True, if a Node was removed // // Note: Can use FindNode to get the node* to remove, // and then call one of the RemoveCase methods bool Remove(const Type& _val) { // TODO: Implement this method } // Returns a space-delimited string of the tree in order /* Example: 24 / \ 10 48 \ \ 12 50 Should return: "10 12 24 48 50" */ // Note: Use to_string to convert an int to its string equivelent // Don't forget about the trailing space! std::string InOrder() { // TODO: Implement this method } private: // Recursive helper method to help with InOrder // // In: _curr The current Node being looked at // _str The string to add to // // NOTE: Use in-order traversal void InOrder(Node* _curr, std::string& _str) { // TODO: Implement this method } };
Help with codes and using C++ I will appreciate it and thumbs up
// Templated binary search tree
template<typename Type>
class BST {
friend class DSA_TestSuite_Lab7; // Giving access to test code
struct Node {
Type data; // The value being stored
Node* left, * right; // The left and right nodes
Node* parent; // The parent node
// Constructor
// Always creates a leaf node
//
// In: _data The value to store in this node
// _parent The parent pointer (optional)
Node(const Type& _data, Node* _parent = nullptr) {
// TODO: Implement this method
}
};
// Data members
Node* mRoot; // The top-most Node in the tree
public:
// Default constructor
// Always creates an empty tree
BST() {
// TODO: Implement this method
}
// Destructor
// Clear all dynamic memory
~BST() {
// TODO: Implement this method
}
// Copy constructor
// Used to initialize one object to another
//
// In: _copy The object to copy from
BST(const BST<Type>& _copy) {
// TODO: Implement this method
}
// Assignment operator
// Used to assign one object to another
//
// In: _assign The object to assign from
//
// Return: The invoking object (by reference)
// This allows us to daisy-chain
BST<Type>& operator=(const BST<Type>& _assign) {
// TODO: Implement this method
}
private:
// Recursive helper method for use with Rule of 3
//
// In: _curr The current Node to copy
//
// NOTE: Use pre-order traversal
void Copy(const Node* _curr) {
// TODO: Implement this method
}
public:
// Clears out the tree and readies it for re-use
void Clear() {
// TODO: Implement this method
}
private:
// Recursive helper method for use with Clear
//
// In: _curr The current Node to clear
//
// NOTE: Use post-order traversal
void Clear(Node* _curr) {
// TODO: Implement this method
}
public:
// Add a value into the tree
//
// In: _val The value to add
void Push(const Type& _val) {
// TODO: Implement this method
}
private:
// Optional recursive helper method for use with Push
//
// In: _val The value to add
// _curr The current Node being looked at
void Push(const Type& _val, Node* _curr, Node* _parent) {
// TODO: Implement this method (Optional)
}
public:
// Checks to see if a value is in the tree
//
// In: _val The value to search for
//
// Return: True, if found
bool Contains(const Type& _val) {
// TODO: Implement this method
}
private:
// Optional helper method for use with Contains and Remove methods
//
// In: _val The value to search for
//
// Return: The node containing _val (or nullptr if not found)
Node* FindNode(const Type& _val) {
// TODO: Implement this method (Optional)
}
// Remove a leaf node from the tree
// Case 0
//
// In: _node The Case 0 node to remove
//
// Note: The node being passed in will always be a Case 0
// Remember to check all 3 subcases
// 1. Root only
// 2. Left leaf node
// 3. Right leaf node
void RemoveCase0(Node* _node) {
// TODO: Implement this method
}
// Remove a node from the tree that has only one child
// Case 1
//
// In: _node The Case 1 node to remove
//
// Note: The node being passed in will always be a Case 1
// Remember to check all 6 subcases
// 1. Root with left child
// 2. Root with right child
// 3. Left node with left child
// 4. Left node with right child
// 5. Right node with left child
// 6. Right node with right child
void RemoveCase1(Node* _node) {
// TODO: Implement this method
}
// Remove a node from the tree that has both children
// Case 2
//
// In: _node The Case 2 node to remove
//
// Note: The node being passed in will always be a Case 2
void RemoveCase2(Node* _node) {
// TODO: Implement this method
}
public:
// Removes a value from tree (first instance only)
//
// In: _val The value to search for
//
// Return: True, if a Node was removed
//
// Note: Can use FindNode to get the node* to remove,
// and then call one of the RemoveCase methods
bool Remove(const Type& _val) {
// TODO: Implement this method
}
// Returns a space-delimited string of the tree in order
/*
Example:
24
/ \
10 48
\ \
12 50
Should return: "10 12 24 48 50"
*/
// Note: Use to_string to convert an int to its string equivelent
// Don't forget about the trailing space!
std::string InOrder() {
// TODO: Implement this method
}
private:
// Recursive helper method to help with InOrder
//
// In: _curr The current Node being looked at
// _str The string to add to
//
// NOTE: Use in-order traversal
void InOrder(Node* _curr, std::string& _str) {
// TODO: Implement this method
}
};
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
