Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Write a program using c++  to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows:   class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.         The insertion of a node to the BST is based on the first letter of the student name.   Your program should display the following:   1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit

Write a program using c++  to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows:   class Node{// node prototype public:       char ch;// this letter is taken from student first letter       string studentName;       Node *leftChild;       Node *rightChild; }; For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.         The insertion of a node to the BST is based on the first letter of the student name.   Your program should display the following:   1.     Insert a node (base on ch) 2.     Find a node (base on student name) 3.     Delete a node (consider all three cases of delete) 4.     Exit

Computer Networking: A Top-Down Approach (7th Edition)
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
icon
Related questions
Question
  1. Write a program using c++  to implement a character-based Binary Search Tree (BST). Each node in the BST should be store student name (string) as follows:

 

class Node{// node prototype

public:

      char ch;// this letter is taken from student first letter

      string studentName;

      Node *leftChild;

      Node *rightChild;

};

For example, if a student’s name is Adam then ch will be equals to A. If the student’s name is Lee then ch will be equal to L.

 

      The insertion of a node to the BST is based on the first letter of the student name.

 

Your program should display the following:

 

1.     Insert a node (base on ch)

2.     Find a node (base on student name)

3.     Delete a node (consider all three cases of delete)

4.     Exit

 

 

Step by step output:

------------------------------------------------------------------------------------------------------------

  1. Insert a node (base on ch)
  2. Find a node (base on student name)
  3. Delete a node (consider all three cases of delete)
  4. Exit

in the picture 

 

 

 

and Output/results provided and explain the algorithm with a given input.

Please select an operation: 1 Please input a name: Lee Display tree 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 1 Please input a name: Adam Display tree L A 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 1 Please input a name: Michele Display tree M A
Transcribed Image Text:Please select an operation: 1 Please input a name: Lee Display tree 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 1 Please input a name: Adam Display tree L A 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 1 Please input a name: Michele Display tree M A
1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 3 Specify the node you want to delete: Adam Display tree M 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 2 Please input a name: Adam Not found 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 4 Exit
Transcribed Image Text:1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 3 Specify the node you want to delete: Adam Display tree M 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 2 Please input a name: Adam Not found 1. Insert a node (base on ch) 2. Find a node (base on student name) 3. Delete a node (consider all three cases of delete) 4. Exit Please select an operation: 4 Exit
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
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
SEE MORE TEXTBOOKS