C++ PROGRAM: Please complete my program Implement the 4 functions: bool search(int num), bool insert (int num) , bool remove(int num), bool isEmpty bstree.h #include "tree.h" #include using namespace std; class BSTree {     BTree* tree;     public:     BSTree() {         tree = new BTree();     } ////////////////////////////////////////////////     bool search(int num) {             } ////////////////////////////////////////////////     bool insert(int num) {         // TODO insert           } ////////////////////////////////////////////////     bool remove(int num) {         // TODO remove          } ///////////////////////////////////////////////     // WARNING. Do not modify this method.     void print() {         if (isEmpty()) {             cout << "EMPTY";             return;         }         cout << "PRE-ORDER: ";         print_preorder(tree->getRoot());         cout << endl << "IN-ORDER: ";         print_inorder(tree->getRoot());         cout << endl << "POST-ORDER: ";         print_postorder(tree->getRoot());         cout << endl << "STATUS: " << check_health(tree->getRoot(), NULL);     } /////////////////////////////////////////////////////     bool isEmpty() {         // TODO isEmpty           } /////////////////////////////////////////////////////     void print_preorder(node* curr) {         // TODO preorder traversal         cout << curr->element << " ";         if(curr->left != NULL){             print_preorder(curr->left);         }         if(curr->right != NULL){             print_preorder(curr->right);         }     }    // } /////////////////////////////////////////////////////     // WARNING. Do not modify this method.     void print_inorder(node* curr) {         if (curr->left != NULL) {             print_inorder(curr->left);         }         cout << curr->element << " ";         if (curr->right != NULL) {             print_inorder(curr->right);         }     } ////////////////////////////////////////////////////     void print_postorder(node* curr) {         // TODO postorder traversal         if(curr->left != NULL){             print_postorder(curr->left);         }         if(curr->right != NULL){             print_postorder(curr->right);         }         cout << curr->element << " ";     }    // } ////////////////////////////////////////////////////     // WARNING. Do not modify this method.     bool check_health(node* curr, node* parent) {         return tree->check_health(curr, parent);     } };

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

C++ PROGRAM: Please complete my program

Implement the 4 functions:

bool search(int num), bool insert (int num) , bool remove(int num), bool isEmpty

bstree.h

#include "tree.h"
#include <iostream>
using namespace std;
class BSTree {
    BTree* tree;

    public:
    BSTree() {
        tree = new BTree();
    }

////////////////////////////////////////////////
    bool search(int num) {
       
    }
////////////////////////////////////////////////
    bool insert(int num) {
        // TODO insert
     
    }
////////////////////////////////////////////////
    bool remove(int num) {
        // TODO remove
    
    }
///////////////////////////////////////////////
    // WARNING. Do not modify this method.
    void print() {
        if (isEmpty()) {
            cout << "EMPTY";
            return;
        }
        cout << "PRE-ORDER: ";
        print_preorder(tree->getRoot());
        cout << endl << "IN-ORDER: ";
        print_inorder(tree->getRoot());
        cout << endl << "POST-ORDER: ";
        print_postorder(tree->getRoot());
        cout << endl << "STATUS: " << check_health(tree->getRoot(), NULL);
    }
/////////////////////////////////////////////////////
    bool isEmpty() {
        // TODO isEmpty
     
    }
/////////////////////////////////////////////////////
    void print_preorder(node* curr) {
        // TODO preorder traversal
        cout << curr->element << " ";
        if(curr->left != NULL){
            print_preorder(curr->left);
        }
        if(curr->right != NULL){
            print_preorder(curr->right);
        }
    }
   // }
/////////////////////////////////////////////////////
    // WARNING. Do not modify this method.
    void print_inorder(node* curr) {
        if (curr->left != NULL) {
            print_inorder(curr->left);
        }
        cout << curr->element << " ";
        if (curr->right != NULL) {
            print_inorder(curr->right);
        }
    }
////////////////////////////////////////////////////
    void print_postorder(node* curr) {
        // TODO postorder traversal
        if(curr->left != NULL){
            print_postorder(curr->left);
        }
        if(curr->right != NULL){
            print_postorder(curr->right);
        }
        cout << curr->element << " ";
    }
   // }
////////////////////////////////////////////////////
    // WARNING. Do not modify this method.
    bool check_health(node* curr, node* parent) {
        return tree->check_health(curr, parent);
    }
};

Expert Solution
steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY