Design a Binary Search Tree ADT by using following functions. Include the function definitions & run the program (Kindly include header files as well). Paste the output as a screenshot and write the code in your answer sheet. insert(int val) find(int x) ************************************************************************************ class btNode { public: int info; btNode lLink; btNode rLink; btNode(int e, btNode l = NULL, btNode r = NULL) { info = e; lLink = l; rLink = r; } btNode() { lLink = NULL; rLink = NULL; } }; class binarySTADT { private: btNode *root; int count = 0; public: binarySTADT() { root = NULL; } void insert(int val); // function to insert a given value in the tree. bool find(int); // function to check if at-least one instance of a given value exists in the binary tree }; Write your function definition here int main() { binarySTADT bt1; cout << "Testing the BST implemetation: Empty Tree created" << endl; bt1.insert(10); bt1.insert(12); bt1.insert(37); bt1.insert(8); bt1.insert(-1); bt1.insert(-6); cout << "Search for 45: " << bt1.find(45) << endl; cout << "Search for 37: " << bt1.find(37) << endl; cout << "Search for -1: " << bt1.find(-1) << endl; }

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...

See similar textbooks

Related questions

Question

1.) Design a Binary Search Tree ADT by using following functions. Include the function definitions & run the program (Kindly include header files as well). Paste the output as a screenshot and write the code in your answer sheet.

insert(int val)
find(int x)
************************************************************************************ class btNode

{ public:

int info; btNode *lLink;

btNode *rLink;

btNode(int e, btNode *l = NULL, btNode *r = NULL)

{

info = e; lLink = l;

rLink = r;

}

btNode()

{

lLink = NULL;

rLink = NULL;

}

};

class binarySTADT

{ private:

btNode *root; int count = 0; public:

binarySTADT()

{

root = NULL;

}

void insert(int val); // function to insert a given value in the tree.

bool find(int); // function to check if at-least one instance of a given value exists in the binary tree };

****Write your function definition here****

int main()

{

binarySTADT bt1;

cout << "Testing the BST implemetation: Empty Tree created" << endl; bt1.insert(10); bt1.insert(12); bt1.insert(37); bt1.insert(8); bt1.insert(-1); bt1.insert(-6);

cout << "Search for 45: " << bt1.find(45) << endl; cout << "Search for 37: " << bt1.find(37) << endl; cout << "Search for -1: " << bt1.find(-1) << endl;

}