Use the following characters in the given order to form the BST tree:20 10 15 30 25 40 0 5 35(Hints: 1. Before you start working on the program, you draw the BST for the given order of the abovecharacters. It will help you check your output for the options in the menu. 2. While working on the program,use enter few items for testing - such as 20 10 15 30, 3. You work on one menu at a time then it is easier totest and manage the program instead of writing the whole program for entire menu then test yourprogram.)Option 4:Deletes a node from the BST.It will prompt: Enter item you want to delete: 30Option 1:Inserts node(s) in a BST.Enter Your Choice 1Enter number of items to insert: 4If the item is found then delete the item from the BST and displays the message -is deleted." If the item is not in the BST, then it will display - ".found in the BST"is notEnter node: 20Inserted.Enter node: 1030 is deletedInserted.Counts the number of leaves in the BST and displays -"There areEnter node: 15Option 5:Inserted.number of leaves in the BST."Enter node: 30Inserted.Option 6:Enter the item and it will display the Parent of that item.It will prompt: Enter the item you want to find the Parent of:Traverse the tree in in-order and display the node info and its left child info andright child info. If a node does not have a child then display NIL.Option 2:Enter Your Choice 2The parent of is_If the item has no parent then it displays:Sample output:has no parent.Traversing In-orderNode Info Left Child Info Right Child InfoEx:Enter the item:10-------10NIL15The parent of 10 is 20.15NILNIL20103030NILNILOption 7:Quit the program.Option 3:Search for the item in the BST.It will prompt: Enter item you want to search for:10If the item is found, then display the message - "is found in the BST". If theitem is not found then it will display -"is not found in the BST"10 is found in the BST. Write a program in C++ to create a Binary Search tree (BST) of integers. The program will performthese operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Parentof a node and Quit.Use the header file similar to this:#include #ifndef BT_H#define BT_Husing namespace std;class BT{private:struct node{int data;node* left;node* right;};node* root;public:BT();bool isEmpty() const { return root == NULL; }void insert(int);void print_inorder();void inorderTrav(node*);void searchBST (int);void deleteNode(int);int count ();int leafCount(node*);void nodeParent(int);//Constructor//Check for empty//Insert item in BST//In-order traversing driver//In-order traversing//Searches BST for a specific node//Delete item from BST//Count driver//Counts number of leaves in BST//Finds parent of a node};#endifUse the following menu in your program.MENU1.Insert node(s)2.Traverse In-order3.Search node4.Delete node5.Leaf Count6.Parent of a node7.QuitEnter your choice:_

Question

Use the following characters in the given order to form the BST tree:20 10 15 30 25 40 0 5 35(Hints: 1. Before you start working on the program, you draw the BST for the given order of the abovecharacters. It will help you check your output for the options in the menu. 2. While working on the program,use enter few items for testing - such as 20 10 15 30, 3. You work on one menu at a time then it is easier totest and manage the program instead of writing the whole program for entire menu then test yourprogram.)Option 4:Deletes a node from the BST.It will prompt: Enter item you want to delete: 30Option 1:Inserts node(s) in a BST.Enter Your Choice <1 - 7> 1Enter number of items to insert: 4If the item is found then delete the item from the BST and displays the message -is deleted." If the item is not in the BST, then it will display - ".found in the BST"is notEnter node: 20Inserted.Enter node: 1030 is deletedInserted.Counts the number of leaves in the BST and displays -"There areEnter node: 15Option 5:Inserted.number of leaves in the BST."Enter node: 30Inserted.Option 6:Enter the item and it will display the Parent of that item.It will prompt: Enter the item you want to find the Parent of:Traverse the tree in in-order and display the node info and its left child info andright child info. If a node does not have a child then display NIL.Option 2:Enter Your Choice <1 -7> 2The parent of is_If the item has no parent then it displays:Sample output:has no parent.Traversing In-orderNode Info Left Child Info Right Child InfoEx:Enter the item:10-------10NIL15The parent of 10 is 20.15NILNIL20103030NILNILOption 7:Quit the program.Option 3:Search for the item in the BST.It will prompt: Enter item you want to search for:10If the item is found, then display the message - "is found in the BST". If theitem is not found then it will display -"is not found in the BST"10 is found in the BST. Write a program in C++ to create a Binary Search tree (BST) of integers. The program will performthese operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Parentof a node and Quit.Use the header file similar to this:#include #ifndef BT_H#define BT_Husing namespace std;class BT{private:struct node{int data;node* left;node* right;};node* root;public:BT();bool isEmpty() const { return root == NULL; }void insert(int);void print_inorder();void inorderTrav(node*);void searchBST (int);void deleteNode(int);int count ();int leafCount(node*);void nodeParent(int);//Constructor//Check for empty//Insert item in BST//In-order traversing driver//In-order traversing//Searches BST for a specific node//Delete item from BST//Count driver//Counts number of leaves in BST//Finds parent of a node};#endifUse the following menu in your program.MENU1.Insert node(s)2.Traverse In-order3.Search node4.Delete node5.Leaf Count6.Parent of a node7.QuitEnter your choice:_

Accepted Answer

According to the question we have to write a program in C++ that creates a BST binary search tree of…