Using the following c++ header file near the bottom, fill in the "TODO" commented parts of the following function to finish the function implement the following PreOrderSearch function: FUNCTION: bool BST::PreOrderSearch(Vertex *V, el_t K) { if (V != NULL) { if (K == V->Elem) { return true; // found the element in V } else if (/* TODO */) { // TODO: traverse left sub-tree of V recursively } else { // TODO: traverse right sub-tree of V recursively } else { return false; } } } BINSTREE.H HEADER FILE // tree element type is int for now typedef int el_t; // el_t is hidden from the client // definition of what a Vertex is - also hidden from the client struct Vertex { Vertex *up; // points to the parent node Vertex *left; el_t elem; Vertex *right; int height; int balance; }; // this is set up to be inherited by another class class BST { public: BST(); // intializes Root ~BST(); // destructor calls dtraverse to destroy the dynamic tree // PURPOSE: these will show the vertices in IN order // TO CALL: No parameter but provide a pointer to // the root vertex in calling INorderTraversal void Display(); void InOrderTraversal(Vertex*); // recursive // PURPOSE: these will search in PRE order - same as Depth First // TO CALL: provide the element to search for; provide a pointer to // the root vertex in calling PREorderSearch bool Search(el_t); bool PreOrderSearch(Vertex*, el_t); // recursive // PURPOSE: This adds a new vertex into the BST // TO CALL: provide the element to be added to the tree void InsertVertex(el_t); // PURPOSE: This deletes a vertex with the given element // - calls remove and findMax (see below) // TO CALL: provide the element to be removed from the tree void DeleteVertex(el_t); // the following can be inherited but not available to the client protected: Vertex *Root; // Root which is a pointer to the root vertex // utility functions follow - these are not for the clients to use // These were created to implement the public methods void deleteTraverse(Vertex*); // traverse and delete all vertices in post order void remove(Vertex*, Vertex*); // removes the vertex knowing its parent el_t findMax(Vertex*); // finds the MAX element in the // left sub-tree of the vertex and also deletes it };
Using the following c++ header file near the bottom, fill in the "TODO" commented parts of the following function to finish the function implement the following PreOrderSearch function:
FUNCTION:
bool BST::PreOrderSearch(Vertex *V, el_t K)
{
if (V != NULL) {
if (K == V->Elem) {
return true; // found the element in V
} else if (/* TODO */) {
// TODO: traverse left sub-tree of V recursively
} else {
// TODO: traverse right sub-tree of V recursively
} else {
return false;
}
}
}
BINSTREE.H HEADER FILE
// tree element type is int for now
typedef int el_t; // el_t is hidden from the client
// definition of what a Vertex is - also hidden from the client
struct Vertex
{
Vertex *up; // points to the parent node
Vertex *left;
el_t elem;
Vertex *right;
int height;
int balance;
};
// this is set up to be inherited by another class
class BST {
public:
BST(); // intializes Root
~BST(); // destructor calls dtraverse to destroy the dynamic tree
// PURPOSE: these will show the vertices in IN order
// TO CALL: No parameter but provide a pointer to
// the root vertex in calling INorderTraversal
void Display();
void InOrderTraversal(Vertex*); // recursive
// PURPOSE: these will search in PRE order - same as Depth First
// TO CALL: provide the element to search for; provide a pointer to
// the root vertex in calling PREorderSearch
bool Search(el_t);
bool PreOrderSearch(Vertex*, el_t); // recursive
// PURPOSE: This adds a new vertex into the BST
// TO CALL: provide the element to be added to the tree
void InsertVertex(el_t);
// PURPOSE: This deletes a vertex with the given element
// - calls remove and findMax (see below)
// TO CALL: provide the element to be removed from the tree
void DeleteVertex(el_t);
// the following can be inherited but not available to the client
protected:
Vertex *Root; // Root which is a pointer to the root vertex
// utility functions follow - these are not for the clients to use
// These were created to implement the public methods
void deleteTraverse(Vertex*);
// traverse and delete all vertices in post order
void remove(Vertex*, Vertex*);
// removes the vertex knowing its parent
el_t findMax(Vertex*); // finds the MAX element in the
// left sub-tree of the vertex and also deletes it
};
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
