Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Binary Trees (C++) You will create a class for Employeclnfo that contains: • Employee ID Number – int • Employee Name – string Implement a binary tree whose nodes hold an instance of your Employeelnfo class. The nodes should be sorted on the Employee ID number. You will have a binary tree class header and implementation file. You can write your main to use the following information to test your tree: Employee ID Number 6702 1255 Employee Name James B W Bevis Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros Archibald Beechcroft Penthor Mul Bartlet Finchley Latham Bine |Jeff Myrtlebank 1071 2390 1558 7406 7562 3004 4922 8483 Your program should read an employee ID and display a message telling the user whether it was found in the tree or not. Your main will have one binary tree object and all of the operations on the binary tree will be class methods. Other functions to add • Add function to display the tree • Allow user to add a new employee • Allow user to remove an employee NOTE – The “NEVER" list of rules: • You will NEVER use break, exit, returm, pass, continue or anything to leave a loop (or iteration), function, or other construct prematurely, unless it is part of the structure as in a case statement. • You will NEVER have a function call itself, unless it is intentional recursion. • You will NEVER use global variables. However, you may use global constants if it is appropriate and they are used properly. You will have only one return statement in a function. (Exception – Multiple return statements may be necessary in a recursive function.|

Binary Trees (C++) You will create a class for Employeclnfo that contains: • Employee ID Number – int • Employee Name – string Implement a binary tree whose nodes hold an instance of your Employeelnfo class. The nodes should be sorted on the Employee ID number. You will have a binary tree class header and implementation file. You can write your main to use the following information to test your tree: Employee ID Number 6702 1255 Employee Name James B W Bevis Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros Archibald Beechcroft Penthor Mul Bartlet Finchley Latham Bine |Jeff Myrtlebank 1071 2390 1558 7406 7562 3004 4922 8483 Your program should read an employee ID and display a message telling the user whether it was found in the tree or not. Your main will have one binary tree object and all of the operations on the binary tree will be class methods. Other functions to add • Add function to display the tree • Allow user to add a new employee • Allow user to remove an employee NOTE – The “NEVER" list of rules: • You will NEVER use break, exit, returm, pass, continue or anything to leave a loop (or iteration), function, or other construct prematurely, unless it is part of the structure as in a case statement. • You will NEVER have a function call itself, unless it is intentional recursion. • You will NEVER use global variables. However, you may use global constants if it is appropriate and they are used properly. You will have only one return statement in a function. (Exception – Multiple return statements may be necessary in a recursive function.|

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
Binary Trees (C++) You will create a class for Emploveelnfo that contains: • Employee ID Number – int Employee Name – string Implement a binary tree whose nodes hold an instance of your Emploveelnfo class. The nodes should be sorted on the Employee ID number. You will have a binary tree class header and implementation file. You can write your main to use the following information to test your tree: Employee Name James B W Bevis Employee ID Number 6702 Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros 1255 1071 2390 1558 7406 Archibald Beechcroft Penthor Mul Bartlet Finchley 7562 3004 4922 Latham Bine 8483 Jeff Myrtlebank Your program should read an employee ID and display a message telling the user whether it was found in the tree or not. Your main will have one binary tree object and all of the operations on the binary tree will be class methods. Other functions to add • Add function to display the tree • Allow user to add a new employee • Allow user to remove an employee NOTE – The “NEVER" list of rules: • You will NEVER use break, exit, return, pass, continue or anything to leave a loop (or iteration), function, or other construct prematurely, unless it is part of the structure as in a case statement. You will NEVER have a function call itself, unless it is intentional recursion. • You will NEVER use global variables. However, you may use global constants if it is appropriate and they are used properly. You will have only one return statement in a function. (Exception – Multiple returm statements may be necessary in a recursive function.|
Transcribed Image Text:Binary Trees (C++) You will create a class for Emploveelnfo that contains: • Employee ID Number – int Employee Name – string Implement a binary tree whose nodes hold an instance of your Emploveelnfo class. The nodes should be sorted on the Employee ID number. You will have a binary tree class header and implementation file. You can write your main to use the following information to test your tree: Employee Name James B W Bevis Employee ID Number 6702 Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros 1255 1071 2390 1558 7406 Archibald Beechcroft Penthor Mul Bartlet Finchley 7562 3004 4922 Latham Bine 8483 Jeff Myrtlebank Your program should read an employee ID and display a message telling the user whether it was found in the tree or not. Your main will have one binary tree object and all of the operations on the binary tree will be class methods. Other functions to add • Add function to display the tree • Allow user to add a new employee • Allow user to remove an employee NOTE – The “NEVER" list of rules: • You will NEVER use break, exit, return, pass, continue or anything to leave a loop (or iteration), function, or other construct prematurely, unless it is part of the structure as in a case statement. You will NEVER have a function call itself, unless it is intentional recursion. • You will NEVER use global variables. However, you may use global constants if it is appropriate and they are used properly. You will have only one return statement in a function. (Exception – Multiple returm statements may be necessary in a recursive function.|
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 13 images

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