Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Q: Write a function that returns the greatest common divisor (GCD) of integers in a list. Use the…
A: NOTE: SINCE THE LANGUAGE OF THE CODE IS NOT MENTIONED, I HAVE USED PYTHON FOR THE SOLUTION. Define…
Q: Write a program that opens two text files(files are attached) and reads their contents into two…
A: THE C++ CODE IS AN GIVEN BELOW :
Q: Please write your own code please do not copy code from other sites. Thank you. in C++ Create a…
A: Step 1: Declare a struct that stores data and pointer to next node. Declare alias to struct node and…
Q: Problem Statement: Remove duplicate values from list In this lab, you will be building a software…
A: """Application that remove the duplicate values from the list""" #user define function to perform…
Q: Create a hand of cards using python code: - 52 cards are in the deck To create a hand of cards,…
A: Note: Follow proper indentation while executing the program. Steps followed to implement the…
Q: What does the operator delete do?
A: Operator delete Delete is an operator that is used to destroy array and non-array or pointer…
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: 1. count_perfect_squares This function takes a single argument, nums , Which is a list of numbers.…
A: Start import math   def  count_perfect_squares(nums): then count =0     if int(root + 0.5) ** 2…
Q: C++ Quadratic Probing: You have a file called athletes.txt Jamie, basketball  Justine, soccer
A: The given function uses quadratic probing to search for a given name or sport in a hash table.…
Q: s are yellow limes are green then the list ["red", "yellow", "green"] s
A: def last_words(fname):    """returns a list containing the last word from each line of the file."""…
Q: Q5: Continue with House class: a) Copy the previous program to a new file. Implement prefix and…
A: In C++ we can overload operator in the same way we overload functions. In operator oerloading values…
Q: What does the delete operator really do?
A: We need to discuss the function of delete operator.
Q: Question: Consider a hash table to size 10. Write a program by using quadratic probing and insert…
A: Quadratic Probing: Quadratic probing is an open-addressing scheme where we look for the i2‘th slot…
Q: Please code using C++ and only use the headers and . The use of any other headers will not be…
A: Define header file <iostream> for i/o operations and <limits.h> for letting the…
Q: Any number of arguments may be used in a catch block.
A: If you are asking if any number of arguments may be in a catch block? My answer is No.…
Q: dify the sample code to prompt the user for a name. Have the program search the existing list for…
A: We need to define a function called search() that accepts a list and name ,search through the list…
Q: Modify the sample code to prompt the user for a name. Have the program search the existing list for…
A: Lets see the solution.
Q: Caesars Cypher in C programming language How do you program an encryption and decryption for a…
A: The Caesar cipher is a type of shift cipher. Shift ciphers work by using the modulo operator to…
Question

(please answer the question in c++ i need the nodes to be able to accept strings like "KIM" used in the example)

 

Option 4:         Deletes a name from the BST.

                        It will prompt: Enter name you want to delete: TOM

 

                        If the name is found then delete the name from the BST and displays the message –“___ is deleted.” If the name is not in the BST, then it will display – “____ is not found in the BST”

 

                        TOM is deleted

 

Option 5:         Counts the number of leaves in the BST and displays –

                        “There are ____ number of leaves in the BST.”

 

Option 6:         Enter a name and it will display the sibling of that person.

                        It will prompt: Enter the name you want to find the sibling of:

                       

                        The sibling of ____ is _____

                        If the person has no sibling, then it displays:

                        ____ has no sibling.

                        Ex:       Enter the item:            PAM

                       

                        The sibling of PAM is DON.

 

Option 7:         Quit the program.

 

           

Write a program in C++ to create a Binary Search tree (BST) of string data. The program will perform these operations: Insert name(s), Traverse Preorder, Search name, Delete name, Leaf Count, sibling of a person and Quit. Use this header file: class BT { private: public: }; struct node { string data; node* left; node* right; node* root; BT(); bool isEmpty() const { return root == NULL; } void insert(string); void print preorder(); void preorderTrav(node*); void searchBST(string); void deleteNode(string); int count(); int leafCount (node*); void nodeSibling (string); Use the following menu in your program. Must place your name in the menu heading. 1. 2. 3. 4. 5. 6. 7. //Constructor //Check for empty //Insert item in BST //Preorder traversing driver //Preorder traversing //Searches BST for a specific node //Delete item in BST //Count driver //Counts number of leaves in BST //Finds sibling of a node Insert name(s) Traverse Preorder Search name Delete name Leaf Count Sibling of a person Quit Enter your choice: Use the following names in the given order to form the BST tree: KIM PAM DON TOM RON BEN AMY
expand button
Transcribed Image Text:Write a program in C++ to create a Binary Search tree (BST) of string data. The program will perform these operations: Insert name(s), Traverse Preorder, Search name, Delete name, Leaf Count, sibling of a person and Quit. Use this header file: class BT { private: public: }; struct node { string data; node* left; node* right; node* root; BT(); bool isEmpty() const { return root == NULL; } void insert(string); void print preorder(); void preorderTrav(node*); void searchBST(string); void deleteNode(string); int count(); int leafCount (node*); void nodeSibling (string); Use the following menu in your program. Must place your name in the menu heading. 1. 2. 3. 4. 5. 6. 7. //Constructor //Check for empty //Insert item in BST //Preorder traversing driver //Preorder traversing //Searches BST for a specific node //Delete item in BST //Count driver //Counts number of leaves in BST //Finds sibling of a node Insert name(s) Traverse Preorder Search name Delete name Leaf Count Sibling of a person Quit Enter your choice: Use the following names in the given order to form the BST tree: KIM PAM DON TOM RON BEN AMY
Option 1: Option 2: Option 3: Inserts name(s) in a BST. Enter Your Choice <1-7> 1 Enter number of items to insert: 4 Enter node: KIM Inserted. Enter node: PAM Inserted. Enter node: DON Inserted. Enter node: TOM Inserted. Traverse the tree in Preorder 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. Enter Your Choice <1-7>2 Sample output: Node Info KIM DON PAM TOM Traversing Preorder Left Child Info Right Child Info DON NIL NIL NIL PAM NIL Search for the name in the BST. It will prompt: Enter name you want to search for: KIM KIM ΤΟΜ NIL If the name is found, then display the name and the left child information and right child information. If the item is not found, then it will display – “ is not found in the BST" Node Info Left Child Info Right Child Info DON PAM
expand button
Transcribed Image Text:Option 1: Option 2: Option 3: Inserts name(s) in a BST. Enter Your Choice <1-7> 1 Enter number of items to insert: 4 Enter node: KIM Inserted. Enter node: PAM Inserted. Enter node: DON Inserted. Enter node: TOM Inserted. Traverse the tree in Preorder 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. Enter Your Choice <1-7>2 Sample output: Node Info KIM DON PAM TOM Traversing Preorder Left Child Info Right Child Info DON NIL NIL NIL PAM NIL Search for the name in the BST. It will prompt: Enter name you want to search for: KIM KIM ΤΟΜ NIL If the name is found, then display the name and the left child information and right child information. If the item is not found, then it will display – “ is not found in the BST" Node Info Left Child Info Right Child Info DON PAM
Expert Solution
Check Mark
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
bartleby
This is a popular solution
See solutionCheck out a sample Q&A here
Step 1
VIEW
Step 2
VIEW
bartleby

Trending nowThis is a popular solution!

bartleby

Step by stepSolved in 2 steps

See solution
Check out a sample Q&A here
Blurred answer
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
SEE MORE TEXTBOOKS