class Node{ public: int data; Node* left; Node* right; Node (int key) { data = key; %3D left = NULL; %3D right = NULL; } }; %3D

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
The following class definitions to implement the Binary Search Tree is given.
class Node (
public:
int data;
Node* left;
Node* right;
Node (int key) {
data = key;
left = NULL;
right = NULL;
};
class BST{
public:
Node* root;
BST () {
root = NULL;
}
Node* insert (Node* root, int key);
Node* search (Node* root, int key);
Node* del (Node* root, int key);
Node* findMin (Node* root);
Node* findMax (Node* root);
void inorder (Node* root);
};
A. Write a program named as ProblemA_<your-student-id>.cpp that implements the following
functions using recursion. Make a menu-based implementation so that you can call each function based
on the user input.
insert: insert a new node in the BST
Node* insert (Node* root, int key);
print: prints the values of all items in the tree, using inorder traversal technique
void inorder (Node* root);
• search: search a node with a value in the BST
Node* insert (Node* root, int key);
findMinimum: returns the element with the minimum value in the BST
Node* findMinimum (Node* root);
findMaximum: returns the element with the maximum value in the BST
Node* findMaximum (Node* root);
delete: delete a node from the BST
Node* delete (Node* root, int key);
Transcribed Image Text:The following class definitions to implement the Binary Search Tree is given. class Node ( public: int data; Node* left; Node* right; Node (int key) { data = key; left = NULL; right = NULL; }; class BST{ public: Node* root; BST () { root = NULL; } Node* insert (Node* root, int key); Node* search (Node* root, int key); Node* del (Node* root, int key); Node* findMin (Node* root); Node* findMax (Node* root); void inorder (Node* root); }; A. Write a program named as ProblemA_<your-student-id>.cpp that implements the following functions using recursion. Make a menu-based implementation so that you can call each function based on the user input. insert: insert a new node in the BST Node* insert (Node* root, int key); print: prints the values of all items in the tree, using inorder traversal technique void inorder (Node* root); • search: search a node with a value in the BST Node* insert (Node* root, int key); findMinimum: returns the element with the minimum value in the BST Node* findMinimum (Node* root); findMaximum: returns the element with the maximum value in the BST Node* findMaximum (Node* root); delete: delete a node from the BST Node* delete (Node* root, int key);
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
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