Employee Tree Program Plan: BinaryTree.h: Create a template prefix and define the template class BinaryTree to perform the following functions: Declare the required variables. Declare the function prototypes. Define the no-argument generic constructor BinaryTree() to initialize the root value as null. Call the functions insertNode(),displayInOrder(), and searchNode(). Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree. Define the generic function insertNode() to create a new node and it is passed inside the insert() function to insert a new node into the tree. Define the generic function searchNode() to search the value in the tree. If it is present, then the function returns a pointer to the value member of the node otherwise it returns false. Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer. Employee.h: Create the header file for employee class. Include the required header files. Create the Employee class. Declare the variables. Declare the friend function BinaryTree to pass the instance of employee class nodes. Create the constructor for Employee() class and assign the corresponding variables for employee identification number and name. Define the method setID() to assign the employee ID. Define the method setName() to assign the string to employee name. Define the method getID() to return the value of employee ID. Return the Boolean value using equal operator to check if the returned employee matches with the value. Using friend class return the employee id number and name using stream object. Main.cpp: Include the required header files. In main() function, Declare the variable. Create the object for BinaryTree. Create the data for employee workers from 1 to 8 individually using the object. Call the function insertNode() to put the employee information into tree. Call the function displayInOrder() to display the tree in order. Prompt the user to enter the employee number. Then call the searchNode() function to search the employee in the tree and assign the information to the pointer. If the pointer is found then print the corresponding message otherwise print the error message. Return the values.

Question

Want to see the full answer?

Answer 1

Question

Chapter 19, Problem 8PC

Program Plan Intro

Employee Tree

Program Plan:

BinaryTree.h:

Create a template prefix and define the template class BinaryTree to perform the following functions:

Declare the required variables.

Declare the function prototypes.

Define the no-argument generic constructor BinaryTree() to initialize the root value as null.

Call the functions insertNode(),displayInOrder(), and searchNode().

Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree.

Define the generic function insertNode() to create a new node and it is passed inside the insert() function to insert a new node into the tree.

Define the generic function searchNode() to search the value in the tree. If it is present, then the function returns a pointer to the value member of the node otherwise it returns false.

Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer.

Employee.h:

Create the header file for employee class.

Include the required header files.

Create the Employee class.

Declare the variables.

Declare the friend function BinaryTree to pass the instance of employee class nodes.

Create the constructor for Employee() class and assign the corresponding variables for employee identification number and name.

Define the method setID() to assign the employee ID.

Define the method setName() to assign the string to employee name.

Define the method getID() to return the value of employee ID.

Return the Boolean value using equal operator to check if the returned employee matches with the value.

Using friend class return the employee id number and name using stream object.

Main.cpp:

Include the required header files.

In main() function,

Declare the variable.

Create the object for BinaryTree.

Create the data for employee workers from 1 to 8 individually using the object.

Call the function insertNode() to put the employee information into tree.

Call the function displayInOrder() to display the tree in order.

Prompt the user to enter the employee number.

Then call the searchNode() function to search the employee in the tree and assign the information to the pointer.

If the pointer is found then print the corresponding message otherwise print the error message.

Return the values.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

The Horse table has the following columns: ID - integer, auto increment, primary key RegisteredName - variable-length string Breed - variable-length string Height - decimal number BirthDate - date Delete the following rows: Horse with ID 5 All horses with breed Holsteiner or Paint All horses born before March 13, 2013 To confirm that the deletes are correct, add the SELECT * FROM HORSE; statement.

Why is Linux popular? What would make someone choose a Linux OS over others? What makes a server? How is a server different from a workstation? What considerations do you have to keep in mind when choosing between physical, hybrid, or virtual server and what are the reasons to choose a virtual installation over the other options?

Objective you will: 1. Implement a Binary Search Tree (BST) from scratch, including the Big Five (Rule of Five) 2. Implement the TreeSort algorithm using a in-order traversal to store sorted elements in a vector. 3. Compare the performance of TreeSort with C++'s std::sort on large datasets. Part 1: Understanding TreeSort How TreeSort Works TreeSort is a comparison-based sorting algorithm that leverages a Binary Search Tree (BST): 1. Insert all elements into a BST (logically sorting them). 2. Traverse the BST in-order to extract elements in sorted order. 3. Store the sorted elements in a vector. Time Complexity Operation Average Case Worst Case (Unbalanced Tree)Insertion 0(1log n) 0 (n)Traversal (Pre-order) 0(n) 0 (n)Overall Complexity 0(n log n) 0(n^2) (degenerated tree) Note: To improve performance, you could use a…