Question

You are requested to save all employees information of a company hospital in a Binary Search Tree (BST). Write a C program that follows these requirements: 1. Declare a struct Node for the Binary Search Tree. The node should have three fields for the data part: int Employeeld, char Employee Name[30] and int salary, and two pointers for the children (left and right). [10 points] 2. Write a recursive function that inserts nodes in the binary search tree, and use Employeeld as key. [20 points) 3. In the main, ask the user how many employees he/she needs to enter, get the data fields, and call the function you wrote in part 2) to insert the nodes to the BST. [15 points] 4. Write a function that prints all the information (data fields for all nodes) in the Tree in PreOrder. [10 points] 5. In the main, call the function you wrote in part 4). [5 points) 6. Write a recursive function that multiplies by 10 all employees' IDs. [10 points) 7. Call this function in the main, then print the updated tree. (5 points) 8. Find the average salary of employees in this company. [20 points) 9. Print the calculated average. [5 points]

note that the solution has to be in ONLY c

Answer 1

Here is the solution if you have any doubts then you can write in the comment section.

Please give feedback.

Solution:

#include<stdio.h> 
#include<stdlib.h>
#include<string.h>

//define struct node  
struct Node 
{ 
    int EmployeeID;
    char EmployeeName[30];
    int salary;
    struct Node *left, *right; 
}*root = NULL; 
   
// A function to create a new BST node 
struct Node *newNode(int id,char name[],int salary) 
{ 
    struct Node *temp =  (struct Node *)malloc(sizeof(struct Node)); 
    //assign values to Node
    temp->EmployeeID = id;
    strcpy(temp->EmployeeName,name);
    temp->salary=salary;
    temp->left = temp->right = NULL; 
    return temp; 
} 
 
/* A function to insert a new node with given key in BST */
struct Node* insert(struct Node* node, int id,char name[],int salary) 
{ 
    /* If the tree is empty, return a new node */
    if (node == NULL) return newNode(id,name,salary); 
  
    /* Otherwise, recur down the tree according to id*/
    if (id < node->EmployeeID) 
        node->left  = insert(node->left, id,name,salary); 
    else if (id > node->EmployeeID) 
        node->right = insert(node->right, id,name,salary);    
  
    /* return the (unchanged) node pointer */
    return node; 
}   
//function to do preorder traversal of BST 
void preorder(struct Node *root) 
{ 
    if (root != NULL) 
    {
        //print data
        printf("EmployeeID: %d  EmployeeName: %s  Salary: %d\n", 
        root->EmployeeID,root->EmployeeName,root->salary);
        //recur for left and right of tree
        preorder(root->left); 
        preorder(root->right); 
    } 
} 

//function to find totalSalary
float totalSalary(struct Node *root)
{
    float total=0;
    if (root != NULL) 
    {  total+=(root->salary)+totalSalary(root->left)+totalSalary(root->right);
    }
    return total;
}
//function to multiply Id by 10 recursively
void multiplyId(struct Node *root) 
{ 
    if (root != NULL) 
    { 
         
        root->EmployeeID*=10;
        multiplyId(root->left); 
        multiplyId(root->right); 
    } 
} 
   

   
// Driver Program to test above functions 
int main() 
{
    int n,i;
    //take number of Employees from user
    printf("Enter Number Of Employees You want to Enter: ");
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        int id,salary;
        char name[30];
        //read data from user
        printf("ID: ");
        scanf("%d",&id);
        printf("Name: ");
        scanf("%s",name);
        printf("Salary: ");
        scanf("%d",&salary);
        if(i==0)
        {
            //insert 1st element and update root
            root = insert(root, id,name,salary);
        }
        else
        {
            //insert element
            insert(root, id,name,salary);
        }
    }
    printf("Employees\n\n");
    // print preoder traversal of the BST 
    preorder(root); 
    //call multiplyId function to multiply Id by 10
    multiplyId(root);
    printf("\n\nEmployees After Updation\n\n");
    // print preoder traversal of the BST 
    preorder(root);
    //call totalSalary to find totalSalary and divide it by n to find average
    float averageSalary=(totalSalary(root)/n);
    //print Average Salary
    printf("Average Salary: %f",averageSalary);
    
    return 0; 
} 

Output:

input Enter Number of Employees You want to Enter: 7 ID: 50 Name: Rakesh Salary: 50000 ID: 30 Name: Anuj Salary: 30000 ID: 20 Name: Rajesh Salary: 20000 ID: 40 Name: Rampratap Salary: 40000 ID: 70 Name: Alok Salary: 70000 ID: 60 Name: Sanjay Salary: 60000 ID: 80 Name: Vipin Salary: 80000 Employees

input Name: Sanjay Salary: 60000 ID: 80 Name: Vipin Salary: 80000 Employees Employee ID: 50 EmployeeName: Rakesh Salary: 50000 EmployeeID: 30 EmployeeName: Anuj Salary: 30000 EmployeeID: 20 EmployeeName: Rajesh Salary: 20000 EmployeeID: 40 EmployeeName: Rampratap Salary: 40000 EmployeeID: 70 EmployeeName: Alok Salary: 70000 EmployeeID: 60 EmployeeName: Sanjay Salary: 60000 EmployeeID: 80 EmployeeName: Vipin Salary: 80000 Employees After Updation EmployeeID: 500 EmployeeName: Rakesh Salary: 50000 EmployeeID: 300 EmployeeName: Anuj Salary: 30000 EmployeeID: 200 EmployeeName: Rajesh Salary: 20000 EmployeeID: 400 EmployeeName: Rampratap Salary: 40000 EmployeeID: 700 EmployeeName: Alok Salary: 70000 EmployeeID: 600 EmployeeName: Sanjay Salary: 60000 EmployeeID: 800 EmployeeName: Vipin Salary: 80000 Average Salary: 50000.000000 ... Program finished with exit code 0 Press ENTER to exit console.

Thnak You!