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:_

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

Write a program in C++ to create a Binary Search tree (BST) of integers. The program will perfor these operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Pare of a node and Quit. Use the header file similar to this: #include #ifndef BT H #define BT H using 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 nod //Delete item from BST //Count driver //Counts number of leaves in BST //Finds parent of a node }; #endif Use the following menu in your program. MENU 1. Insert node(s) 2. Traverse In-order 3. Search node 4. Delete node 5. Leaf Coun 6. Parent of a node 7. Quit Enter your choice:

Write a program in C++ to create a Binary Search tree (BST) of integers. The program will perfor these operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Pare of a node and Quit. Use the header file similar to this: #include #ifndef BT H #define BT H using 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 nod //Delete item from BST //Count driver //Counts number of leaves in BST //Finds parent of a node }; #endif Use the following menu in your program. MENU 1. Insert node(s) 2. Traverse In-order 3. Search node 4. Delete node 5. Leaf Coun 6. Parent of a node 7. Quit Enter your choice:

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

Q: for c++ please thank you 4, List search Modify the linked listv class you created in the…

A: Please give positive ratings for my efforts. Thanks. ANSWER

Q: Read this: Complete the code in Visual Studio using C++ Programming Language with 1 file or clear…

A: Doubly linked List: - In the Linked list a node contains the value and the pointer to the next node…

Q: // FILE: DPQueue.h // CLASS PROVIDED: p_queue (priority queue ADT) // // TYPEDEFS and MEMBER…

A: The implementation of the pop() function in the provided DPQueue.h header file consists only of an…

Q: Structute Using c++ Queue The Full Question is on the Picture I need to continue on this code…

A: It is defined as a direct descendant of C programming language with additional features such as type…

Q: Data structure & alogrithum java program Create a corresponding DRIVER/Tester class that performs…

A: Java Programming Creating instance of Deque Containing list of string data type Check if deque is…

Q: Write a program that takes the tree created in PRG-1 and remove the two data items 37, and 54 and…

A: The given program is a C++ code that creates a binary tree and traverses it using inorder, preorder,…

Q: Canvas Assume class StackType has been defined to implement a stack data structure as discussed in…

A: Taking a stack and a variable count for solving the following question

Q: owrreo TO), (2) er, and Then, create a “search()" function that can traverse through the binary…

A: Here, the task mentioned in the question is to write a c++ code to search values in a Binary Search…

Q: In C++ Plz LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main(),…

A: Answer : Here's a possible implementation of the InsertAtEnd() function in the ItemNode class: void…

Q: 1. The nodes are connected using singly linked list. Current pointer defined as node* Head points to…

A: The program is written in c++ #include <iostream>using namespace std; struct Node{ int…

Q: Develop a C++ "doubly" linked list class of your own that can hold a series of signed shorts…

A: DoublyLinkedList Class:Define a private nested Node struct/class within the DoublyLinkedList class,…

Q: Design a C++ program which reads any number of integers in a linked list until "-1" is entered. Then…

A: Here is the c++ program of the above problem. See below step for code.

Q: Using the code source screenshot (C++) explain in depth what each line of code does.

A: #include <iostream>#include <cstdlib>using namespace std;// this is node struct with…

Q: Incoroporate or use below code as reference #include #include #include typedef struct…

A: *As per the company norms and guidelines we are providing first question answer only please repost…

Q: ain.cpp #include #include #include using namespace std; // TODO: Write method to create and…

A: Step 1: Prompt and accept the string of names separated by spaces and ending with -1. Step 2:…

Q: C++ program Reverse Phone Book you are given map object named phone_book. write a program that…

A: We have to create C++ program Reverse Phone Book you are given map<string,int> object named…

Q: hello. This is my code: #include #include #include typedef struct HuffmanNode { int…

A: Huffman Tree:The Huffman tree is a binary tree used in data compression algorithms. It assigns…

Q: #include using namespace std; class st{ private: int arr[100]; int top; public: st(){…

A: this is user friendly code to understand it easily. we use switch condition to make user friendly…

Question

100%

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 above
characters. 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 to
test and manage the program instead of writing the whole program for entire menu then test your
program.)
Option 4:
Deletes a node from the BST.
It will prompt: Enter item you want to delete: 30
Option 1:
Inserts node(s) in a BST.
Enter Your Choice <1 - 7> 1
Enter number of items to insert: 4
If 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 not
Enter node: 20
Inserted.
Enter node: 10
30 is deleted
Inserted.
Counts the number of leaves in the BST and displays -
"There are
Enter node: 15
Option 5:
Inserted.
number of leaves in the BST."
Enter node: 30
Inserted.
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 and
right child info. If a node does not have a child then display NIL.
Option 2:
Enter Your Choice <1 -7> 2
The parent of is_
If the item has no parent then it displays:
Sample output:
has no parent.
Traversing In-order
Node Info Left Child Info Right Child Info
Ex:
Enter the item:
10
-------
10
NIL
15
The parent of 10 is 20.
15
NIL
NIL
20
10
30
30
NIL
NIL
Option 7:
Quit the program.
Option 3:
Search for the item in the BST.
It will prompt: Enter item you want to search for:
10
If the item is found, then display the message - "
is found in the BST". If the
item 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 perform
these operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Parent
of a node and Quit.
Use the header file similar to this:
#include <iostream>
#ifndef BT_H
#define BT_H
using 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
};
#endif
Use the following menu in your program.
MENU
1.
Insert node(s)
2.
Traverse In-order
3.
Search node
4.
Delete node
5.
Leaf Count
6.
Parent of a node
7.
Quit
Enter your choice:_

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 5 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

C++ Consider the following function as a property of a LinkedBag that contains a Doubly Linked List. Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods. Assume that the doubly linked list is: 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6 If you are uncertain what the above diagram depicts, it is a doubly linked list such that: The head of this doubly linked list is the node that contains the value 1. The tail of this doubly linked list is the node that contains the value 6. The 3rd node in this list contains the value 3. The contents of this list are the values 1 through 6 in sequential order. The following questions are regarding the linked list after after the test_function is run. A. The head of the list after the test_function is run contains the value: B. The tail of the list after the test_function is run contains the value: C. The 3rd node in the list after the test_function is run…
// FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)//// TYPEDEFS and MEMBER CONSTANTS for the p_queue class:// typedef _____ value_type// p_queue::value_type is the data type of the items in// the p_queue. It may be any of the C++ built-in types// (int, char, etc.), or a class with a default constructor, a// copy constructor, an assignment operator, and a less-than// operator forming a strict weak ordering.//// typedef _____ size_type// p_queue::size_type is the data type considered best-suited// for any variable meant for counting and sizing (as well as// array-indexing) purposes; e.g.: it is the data type for a// variable representing how many items are in the p_queue.// It is also the data type of the priority associated with// each item in the p_queue//// static const size_type DEFAULT_CAPACITY = _____// p_queue::DEFAULT_CAPACITY is the default initial capacity of a// p_queue that is created by the default…
C＋＋
// FILL IN THE BLANKS (LINKED-LISTS CODE) (C++)#include<iostream>using namespace std; struct ________ {int data ;struct node *next; }; node *head = ________;node *createNode() { // allocate a memorynode __________;temp = new node ;return _______ ;} void insertNode(){node *temp, *traverse;int n;cout<< "Enter -1 to end "<<endl;cout<< "Enter the values to be added in list"<<endl;cin>>n; while(n!=-1){temp = createNode(); // allocate memorytemp->data = ________;temp->next = ________;if ( ___________ == NULL){head = _________;} else {traverse = ( );while (traverse->next != ________{traverse = traverse-> ___________;} traverse->next= temp;} cout<<"Enter the value to be added in the list"<<endl;cin>>n; }} void printlist(){node *traverse = head; // if head == NULLwhile (traverse != NULL) { cout<<traverse->data<<" ";traverse = traverse->next;}} int main(){int option; do{cout<<"\n =============== MAIN…
C++ Data Structure:Create an AVL Tree C++ class that works similarly to std::map, but does NOT use std::map. In the PRIVATE section, any members or methods may be modified in any way. Standard pointers or unique pointers may be used.** MUST use given Template below: #ifndef avltree_h#define avltree_h #include <memory> template <typename Key, typename Value=Key> class AVL_Tree { public: classNode { private: Key k; Value v; int bf; //balace factor std::unique_ptr<Node> left_, right_; Node(const Key& key) : k(key), bf(0) {} Node(const Key& key, const Value& value) : k(key), v(value), bf(0) {} public: Node *left() { return left_.get(); } Node *right() { return right_.get(); } const Key& key() const { return k; } const Value& value() const { return v; } const int balance_factor() const {…
#include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) { unsigned int i; for (i = 0; i < numsList.size(); ++i) { cout << numsList.at(i) << " "; } cout << endl;} int main() { vector<int> numsList; int userInput; int i; for (i = 0; i < 3; ++i) { cin >> userInput; numsList.push_back(userInput); } numsList.erase(numsList.begin()+1); numsList.insert(numsList.begin()+1, 102); numsList.insert(numsList.begin()+1, 100); PrintVectors(numsList); return 0;} Not all tests passed clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8 Not sure what I did wrong but the the 33…
C++ Given code #include <iostream>using namespace std; class Node {public:int data;Node *pNext;}; void displayNumberValues( Node *pHead){while( pHead != NULL) {cout << pHead->data << " ";pHead = pHead->pNext;}cout << endl;} //Option 1: Search the list// TODO: complete the function below to search for a given value in linked lsit// return true if value exists in the list, return false otherwise. ?? linkedlistSearch( ???){ } //Option 2: get sum of all values// TODO: complete the function below to return the sum of all elements in the linked list. ??? getSumOfAllNumbers( ???){ } int main(){int userInput;Node *pHead = NULL;Node *pTemp;cout<<"Enter list numbers separated by space, followed by -1: "; cin >> userInput;// Keep looping until end of input flag of -1 is givenwhile( userInput != -1) {// Store this number on the listpTemp = new Node;pTemp->data = userInput;pTemp->pNext = pHead;pHead = pTemp;cin >> userInput;}cout <<"…
use code below in part with bts #include <stdio.h>#include <stdlib.h>#include <time.h> typedef struct node_struct {int item;struct node_struct *next;} node; /*** 10->NULL* We want to insert 20* First call ([10], 20) [not complete]* {10, {20, NULL}} To compute the conditional probabilities you need to determine unigram andbigram counts first (you can do this in a single pass through a file if you do thingscarefully) and store them in a Binary Search Tree (BST). After that, you can computethe conditional probabilities.Input filesTest files can be found on (http://www.gutenberg.org/ebooks/). For example,search for “Mark Twain.” Then click on any of his books. Next download the “PlainText UTF-8” format.In addition, you should test your program on other input files as well, for which youcan hand-compute the correct answer.Output filesYour program must accept the name of an input file as a command line argument.Let's call the file name of this file fn. Your program must…
C programming fill in the following code #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…