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 21, 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

Change the following code so that there is always at least one way to get from the left corner to the top right, but the labyrinth is still randomized. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. Take care that the player and the dragon cannot start off on walls. Also the dragon starts off from a randomly chosen position public class Labyrinth { private final int size; private final Cell[][] grid; public Labyrinth(int size) { this.size = size; this.grid = new Cell[size][size]; generateLabyrinth(); } private void generateLabyrinth() { Random rand = new Random(); for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { // Randomly create walls and paths grid[i][j] = new Cell(rand.nextBoolean()); } } // Ensure start and end are…

Change the following code so that it checks the following 3 conditions: 1. there is no space between each cells (imgs) 2. even if it is resized, the components wouldn't disappear 3. The GameGUI JPanel takes all the JFrame space, so that there shouldn't be extra space appearing in the frame other than the game. Main(): Labyrinth labyrinth = new Labyrinth(10); Player player = new Player(9, 0); Dragon dragon = new Dragon(9, 9); JFrame frame = new JFrame("Labyrinth Game"); GameGUI gui = new GameGUI(labyrinth, player, dragon); frame.add(gui); frame.setSize(600, 600); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setVisible(true); public class GameGUI extends JPanel { private final Labyrinth labyrinth; private final Player player; private final Dragon dragon; //labyrinth, player, dragon are just public classes private final ImageIcon playerIcon = new ImageIcon("data/images/player.png");…

Make the following game user friendly with GUI, with some simple graphics. The GUI should be in another seperate class, with some ImageIcon, and Game class should be added into the pane. The following code works as this: The objective of the player is to escape from this labyrinth. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. The player can move only in four directions: left, right, up or down. There are several escape paths in all labyrinths. The player’s character should be able to moved with the well known WASD keyboard buttons. If the dragon gets to a neighboring field of the player, then the player dies. Because it is dark in the labyrinth, the player can see only the neighboring fields at a distance of 3 units. Cell Class: public class Cell { private boolean isWall; public Cell(boolean isWall) { this.isWall = isWall; } public boolean isWall() { return…