Program Plan: 1. The below-mentioned variables are used: A variable name to store the string type of value that is used to store the name of the software. A variable record_pos to store the position of the software in the file. Two pointer type of variablesleft and right to store the left and right tree. A global variable pos is initialized to 0. 2.The below-mentioned functions are used in the program: createNode()function to create the nodes in the binary search tree. inorderTraversal() function to display English words in alphabetical order checkNodee() function to check the given word is in the tree or not. insertNode()to insert the node in a binary search tree. createTree() function to create a binary search tree. InsertNewSoftware() function to check whether the given software already exists or not. leftMostValue() function to find leftmost node of the tree. nodeDeletion() function to delete the node of a tree. sell() function to update the quantity field in the file. clean() function to clean the quantity field in the file having quantity value as 0. Program description: Toimplement a menu-driven program for management of the software store. Modified Program: // Include the header files #include <stdio.h> #include <string.h> #include <stdlib.h> #include <fstream> #include <iostream> using namespace std; /* Define a structure for Tree_node that have two fields, key name and position in file, and two pointers left and right */ struct Tree_node { // Name of the software with version is the key field string name; // Position of the software in the file int record_pos; // Two pointers of the node Tree_node *left, *right; } *root; // Function to create a node in the tree and return that node struct Tree_node * createNode(string name, int pos) { // Create a new node tp struct Tree_node * tp=new Tree_node(); // Assign the name as given name in the function tp->name=name; // Assign record_pos as position given in function tp->record_pos=pos; // Set the left pointer as NULL tp->left=NULL; // Set the right pointer as NULL tp->right=NULL; // Return the created node of the tree return tp; } // Declare a global variable pos and assign 0 to it int pos=0; // Function to traverse the tree in in-order void inorderTraversal(Tree_node *tree_node ) { // If tree is empty if( tree_node == NULL ) // Return return; // Traveres the left subtree of node inorderTraversal( tree_node->left ); // Output the name in the node std::cout<name<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Traverse the right subtree of the node inorderTraversal( tree_node->right ); } /* Function to check the given node is there in the tree by name */ bool checkNode( Tree_node *tree_node, string name ) { // If tree is empty if ( tree_node == NULL ) { // Tree does not contain the searched node return false; } /* If the name of the node to be searched is same as that of current node name */ else if ( name == tree_node->name ) { /* Assign to pos the current node record_pos to know the position in the file */ pos=tree_node->record_pos; /* Return true since tree contain the searched node */ return true; } /* If the name of the node to be searched is less than current node name*/ else if ( name<tree_node->name ) { /* Call the recursive function checkNode() with left subtree as parameter */ return checkNode( tree_node->left, name ); } /* If the name of the node to be searched is equal or greater than current node name */ else { /* Call the recursive function checkNode() with right subtree as parameter */ return checkNode( tree_node->right, name ); } } /* Function to insert node in the tree with name and position as parameter */ void insertNode(Tree_node &*root, string name, int pos) { // If tree is empty if ( root == NULL ) { // Create a new node and assign it to root root = createNode(name,pos) ; // Return return; } /* If the name of the node to be inserted is less than current node name */ else if ( name< root->name ) { /* Call the recursive function insertNode() with left sub tree as parameter */ insertNode( root->left, name, pos ); } /* If the name of the node to be inserted is equal or greater than current node name */ else { /* Call the recursive function insertNode() with right sub tree as parameter */ insertNode( root->right, name, pos ); } } // Function to create a tree void createTree() { // Declare variables string name; ifstreaminfile; string fin1,fin2,fin3,fin4,fin5,fin6; int i=0; string line; // Open the input file infile.open("input.txt"); /* Untill the file is empty read each line and extract the name of the software and version then assign it to the name*/ while(getline(infile, line)) { // Assign each line to string stream istringstreamiss(line); // Assign null to fin5 and fin6 fin5="\0"; fin6="\0"; /* Assign each word of the line to variable fin1 to fin6 */ iss>> fin1>>fin2>>fin3>>fin4>>fin5>>fin6; /* For different software the name and version different number of words. To get the correct name of the software and version start from end. The last two words will be price and quantity */ // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the line has four words*/ if(fin5.empty()) { /* The first two words contain the name of the software and the version*/ name=fin1+" "+fin2; } // Otherwise the line has five words else { /* The first three word contain name of the software and the version */ name=fin1+" "+fin2+" "+fin3; } } // Otherwise the line has six words else { /* The first four word contain name of the software and the version*/ name=fin1+" "+fin2+" "+fin3+" "+fin4; } /* Insert the node with name of the software and version as key field*/ insertNode(root,name, i); // Increment the position i++; } // Close the file infile.close(); } /* Function to insert new software, here check the software already exists, if exists update the quantity field*/ void InsertNewSoftware() { // Declare variables string software, quantity,name; bool found; string fin1,fin2,fin3,fin4,fin5,fin6; // Prompt the user to input the software std::cout<<"Enter the software"<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Ignore the newline character cin.ignore(); // Get the input to variable software getline(cin,software); // Assign software to string stream istringstreamiss(software); /* Assign each word of the software to variable fin1 to fin6*/ iss>> fin1>>fin2>>fin3>>fin4>>fin5>>fin6; // If fin6 is empty if(fin6.empty()) { // If fin5 is empty the software has four words if(fin5.empty()) { /* The first two words contain the name of the software and the version*/ name=fin1+" "+fin2; } // Otherwise the software has five words else { /* The first three word contain name of the software and the version */ name=fin1+" "+fin2+" "+fin3; } } // Otherwise the software has six words else { /* The first four word contain name of the software and the version*/ name=fin1+" "+fin2+" "+fin3+" "+fin4; } // Check the name is there in the tree found=checkNode(root,name); // Declare variables ifstreaminfile; string line; /* If name is present in the tree extract the quantity field since the name already exists*/ if(found==true) { // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the software has four words*/ if(fin5.empty()) { /* The third word contain the quantity */ quantity=fin3; } /* Otherwise the software has five words */ else { /* The fourth word contain the quantity */ quantity=fin4; } } // Otherwise the software have six words else { // The fifth word contain the quantity quantity=fin5; } // Declare variable string soft[100]; string str; int k=0; // Open the input file infile.open("input.txt"); /* Find the line in the file that have the software given by using the position and update quantity */ for (int lineno = 0; getline (infile,line)!=NULL ; lineno++) { /* If the position of the given software reached */ if (lineno == pos) { // Assign line to string stream istringstreamiss(line); /* Assign each word of the line to variable fin1 to fin6 */ iss>> fin1>>fin2>>fin3>>fin4>>fin5>>fin6; // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the line has four words */ if(fin5.empty()) { /* The third word contain the quantity */ fin3=quantity; } /* Otherwise the line has five words */ else { /* The fourth word contain the quantity */ fin4=quantity; } } // Otherwise the line has six words else { /* The fifth word contain the quantity */ fin5=quantity; } /* Create line by combining variables from fin1 to fin6 */ line= fin1+" "+fin2+" "+fin3+" "+fin4+" "+fin5+ " "+fin6; } /* Assign line to the array. The array contains all lines in the file with updated quantity */ soft[k]=line; // Increment the index of the array k++; } //Declare variable ofstream out; // Open the file in write mode out.open("input.txt", ios::out); // Write each line in the array to the file for(int i=0;i<k;i++)< p="" style="box-sizing: border-box;"></k;i++)<> { /* If the line is last then there is no need of newline character */ if(i==k-1) // Write the line into the file out<<soft[i];< p="" style="box-sizing: border-box;"></soft[i];<> /* If the line is not last newline character needed */ else // Write the line into the file out<<soft[i]<<endl;< p="" style="box-sizing: border-box;"></soft[i]<<endl;<> } } // If the given software is not present in the tree else { // Declare variable ofstream out; // Open the file in append mode out.open("input.txt", ios::app); // Append the software at the end of the file out<<endl<<software;< p="" style="box-sizing: border-box;"></endl<<software;<> // Close the file out.close(); // Empty the tree root=NULL; // Create tree with updated file createTree(); // Display the in-order traversal cout<<"The inorder traversal of the tree after inserting new software is"<<endl;< p="" style="box-sizing: border-box;"></endl;<> inorderTraversal(root); } } // Function to find the leftmost node in the tree struct Tree_node * leftMostValue(struct Tree_node* Tree_node) { // Create a ne node p and assign the node to it struct Tree_node* p = Tree_node; // Loop untill reach to the leftmost node while (p->left != NULL) // Assign to p the left child of p p = p->left; // Return the left most node in the value return p; } // Function to delete node in the tree struct Tree_node* nodeDeletion(struct Tree_node* tree_node, string name) { // If tree is empty if (tree_node == NULL) // Return root return root; /* If the node to be deleted has name less than current node name */ if (name <tree_node->name) /* Call the recursive function nodeDeletion() with left subtree as parameter */ tree_node->left = nodeDeletion(tree_node->left, name); /* If the node to be deleted has name greater than current node name */ else if (name >tree_node->name) /* Call the recursive function nodeDeletion() with right sub tree as parameter */ tree_node->right = nodeDeletion(tree_node->right, name); /* If the node to be deleted has name same as that of the current node name */ else { // If the tree have no child or one right child if (tree_node->left == NULL) { /* Create a new node tp and assign the right sub tree to the node to it */ struct Tree_node *tp = tree_node->right; // Remove the node free(tree_node); // Return the modified tree return tp; } // If the tree have no child or one left child else if (tree_node->right == NULL) { /* Create a new node tp and assign the left sub tree to the node to it */ struct Tree_node *tp = tree_node->left; // Remove the node free(tree_node); // Return the modified tree return tp; } /* If the node has the left and right sub tree, find the in-order successor, the leftmost node in the right sub tree */ struct Tree_node* tp = leftMostValue(tree_node-> right); // Copy in-order successor to the node tree_node->name = tp->name; // Delete the in-order successor node tree_node->right = nodeDeletion(tree_node->right, tp->name); } // Return the modified tree return tree_node; } // Function to sell the software void sell() { // Declare variables string product; int copies; bool found; ifstreaminfile; // Declare variables string line; string quantity; string soft[100]; // Declare variables string fin1,fin2,fin3,fin4,fin5,fin6; int k=0; // Prompt the user to enter the software to be sold std::cout<<"Enter the product to be sold"<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Ignore the new line character cin.ignore(); // Copy the input to the product getline(cin,product); // Prompt the user to enter the quantities to be sold std::cout<<"Enter the quantities to be sold"<<endl;< p="" style="box-sizing: border-box;"></endl;<> cin>>copies; // Open the file infile.open("input.txt"); // Check the product is there in the tree found=checkNode(root,product); // If software is there in the tree if(found==true) { /* Find the line in the file that have the product given by using the position and find quantity */ for (int lineno = 0; getline (infile,line)!=NULL ; lineno++) { // If product is there in the file if (lineno == pos) { // Assign line to string stream stringstreamiss(line); /* Assign each word of the line to variable fin1 to fin6 */ iss>> fin1>>fin2>>fin3>>fin4>>fin5>>fin6; // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the line has four words */ if(fin5.empty()) { /* Assign the third word to the quantity */ quantity=fin3; } /* Otherwise the lines have five words */ else { /* Assign the fourth word to the quantity */ quantity=fin4; } } // Otherwise the line has six words else { /* Assign the fifth word to the quantity */ quantity=fin5; } /* Subtract the copies to be sold from the quantity of software */ copies=stoi(quantity)-copies; /* To convert the integer to string declare variable stringstream */ std::stringstream outs; // Declare a string variable string remaining; // Copy the copies to out outs << copies; /* Convert outs to string and copy to remaining */ remaining = outs.str(); // If there are copies to be sold if(copies>=0) { // If the software is sold out if (copies==0) { /* Delete the node containing the name of sold out software from the tree */ root=nodeDeletion(root,product); /* Display the in-order traversal of the tree */ cout<<"After the product is sold out the inorder traversal of the tree is"<<endl;< p="" style="box-sizing: border-box;"></endl;<> inorderTraversal(root); // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the line has four words */ if(fin5.empty()) { /* Assign the value of quantity as 0 */ fin3="0"; } /* Otherwise the line has five words */ else { /* Assign the value of quantity as 0 */ fin4="0"; } } /* Otherwise the line has six words */ else { /* Assign the value of quantity as 0 */ fin5="0"; } } /* Otherwise if the software is not sold out */ else { // If fin6 is empty if(fin6.empty()) { /* If fin5 is empty the line has four words */ if(fin5.empty()) { /* Assign the value of quantity as remaining */ fin3=remaining; } /* Otherwise the line has five words */ else { /* Assign the value of quantity as remaining */ fin4=remaining; } } /* Otherwise the line has six words */ else { /* Assign the value of quantity as remaining */ fin5=remaining; } } } /* If the number of copies to be sold is out of stock */ else { // Display message std::cout<<"Out of copies"<<endl;< p="" style="box-sizing: border-box;"></endl;<> } /* Combine all the variables from fin1 to fin6 and assign it to the line */ line= fin1+" "+fin2+" "+fin3+" "+fin4+" "+fin5+ " "+fin6; } /* Insert line into the array, so array have all lines of the file updated */ soft[k]=line; // Increment the index of the array k++; } // Close the file infile.close(); // Declare variable ofstream out; // Open the file in write mode out.open("input.txt", ios::out); // Copy all the lines in the array to file for(int i=0;i<k;i++)< p="" style="box-sizing: border-box;"></k;i++)<> { // If the line is last if(i==k-1) /* Write the line to the file without new line character */ out<<soft[i];< p="" style="box-sizing: border-box;"></soft[i];<> // Otherwise if the line is not last else /* Write the line to the file with new line character */ out<<soft[i]<<endl;< p="" style="box-sizing: border-box;"></soft[i]<<endl;<> } // Close the file out.close(); } // Otherwise the given product is not present else { // Display the message std::cout<<"The given product is not there"<<endl;< p="" style="box-sizing: border-box;"></endl;<> } } /* Function to remove the entry that has quantity 0 from the file and assign the entry in eof to that position */ void clean() { // Declare variables ifstreaminfile,infile1; string line; int i; // Open the file infile.open("input.txt"); // Declare the variables string soft[10]; string soft2[10]; string fin1,fin2,fin3,fin4,fin5,fin6; string quantity; // Insert each line of the file into the array for(i=0;getline(infile,line)!=NULL; i++) { soft[i]=line; } // Declare a variable l and assign i to it int l=i; // Decrement the value of i i=i-1; // Open the input file infile1.open("input.txt"); // For each line in the array for(int k=0;k<l;k++)< p="" style="box-sizing: border-box;"></l;k++)<> { // Assign each line to string stream istringstreamiss(soft[k]); /* Assign each word of the line to variable fin1 to fin6 */ iss>> fin1>>fin2>>fin3>>fin4>>fin5>>fin6; // If fin6 is empty if(fin6.empty()) { // If fin5 is empty the line has four words if(fin5.empty()) { // Assign fin3 to quantity quantity=fin3; } // Otherwise the line has five words else { // Assign fin4 to quantity quantity=fin4; } } // Otherwise if the line has six words else { // Assign fin5 to quantity quantity=fin5; } // If quantity is 0 remove that entry if(quantity=="0") { /* Assign the last line of the file to the position with quantity 0 */ soft[k]=soft[i]; // Assign null value to ith cell soft[i]="\0"; // Decrement i value i--; /* Decrement l value to find number of lines in the file */ l--; } } // Close the file infile.close(); // Open the file in write mode ofstream out; out.open("software.txt", ios::out); // Write each line from the array to output file for(int k=0;k<l;k++)< p="" style="box-sizing: border-box;"></l;k++)<> { // If the line is last if(k==l-1) // Write the line into the file without new line character out<<soft[k];< p="" style="box-sizing: border-box;"></soft[k];<> // If the line is not last else /* Write the line into the file with new line character */ out<<soft[k]<<endl;< p="" style="box-sizing: border-box;"></soft[k]<<endl;<> } // Close the output file out.close(); } // Main function int main() { // Declare variables int ch; char input='Y'; // Call function createTree() createTree(); // Display the in-order traversal cout<<"The inorder traversal of the initial tree is"<<endl;< p="" style="box-sizing: border-box;"></endl;<> inorderTraversal(root); // Loop until the user need to continue while(input=='Y') { // Display the menu std::cout<<endl<<endl;< p="" style="box-sizing: border-box;"></endl<<endl;<> std::cout<<"1: Insert new software"<<endl;< p="" style="box-sizing: border-box;"></endl;<> std::cout<<"2: Sell the software"<<endl;< p="" style="box-sizing: border-box;"></endl;<> std::cout<<"3: Exit"<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Prompt the user to enter the choice std::cout<<"Enter the choice"<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Read the input variable to ch cin>>ch; // Switch case switch(ch) { // Case 1 insert new software case 1: // Call the function InsertNewSoftware() InsertNewSoftware(); break; // Case 2 sell the software case 2: // Call the function sell() sell(); break; // Case 3 Clean the file case 3: // Call the function clean() clean(); break; // Default case default: std::cout<<"Error, bad input, quitting\n"; break; } // Prompt the user to continue or not std::cout<<"Do you want to continue?"<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Read the input entered to variable input cin>>input; } // Pause the output console system("pause"); // Return 0 return 0; } Software.txt Output: The inorder traversal of the initial tree is Adobe Photoshop CS5 Norton SystemWorks 2009 Norton Utilities Visual Studio Professional 2010 1: Insert new software 2: Sell the software 3: Exit Enter the choice 1 Enter the software Microsoft Office 2010 20 150 The inorder traversal of the tree after inserting new software is Adobe Photoshop CS5 Microsoft Office 2010 Norton SystemWorks 2009 Norton Utilities Visual Studio Professional 2010 Do you want to continue? Y 1: Insert new software 2: Sell the software 3: Exit Enter the choice 2 Enter the product to be sold Norton SystemWorks 2009 Enter the quantities to be sold 6 After the product is sold out the inorder traversal of the tree is Adobe Photoshop CS5 Microsoft Office 2010 Norton Utilities Visual Studio Professional 2010 Do you want to continue? Y 1: Insert new software 2: Sell the software 3: Exit Enter the choice 3 Do you want to continue? N Explanation: In this code,all the information of the software is first of all stored in the file named software.txt. The program above creates the binary search tree for this file automatically and the key is the name and version of the software. Another node field stores the position of the record which is in the file. The file and tree are updated whenever new software arrives at the store. If any new package arrives then it is stored at the end of the tree but if any software already exists then only the quantity field is updated. If any package is sold then that node should be deleted from the tree and so on.

EBK DATA STRUCTURES AND ALGORITHMS IN C

4th Edition

ISBN: 9781285415017

Author: DROZDEK

Publisher: YUZU

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 6, Problem 2PA

Chapter 6, Problem 4PA

Students have asked these similar questions

Write a Java program that creates and maintains a binary search tree (BST) whose nodes are studentrecords. Each student record (BST node) contains the student’s id (String), name (String) and GPA(float). Use the student id as a key for the BST. The program starts with an empty BST and offers thefollowing menu options to the user repeatedly until the user selects the ‘Q’ option (quit). A: Add a new student record to the BST.Here the user is prompted to enter the new student’s id, name and GPA. The program shoulddisplay an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the programdisplays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program shoulddisplay an error message if the student id is not found in the BST.

Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P:…

write a C++ Program Your task is to develop a program for a hospital where they need help to calculate and maintainthe number of patients, their disease, and their allotted room numbers. You will use a SinglyLinkedList to store record of a patient such as patient name, patient CNIC, patient disease, admitdate and patient allotted room number.Suppose if a patient has been recovered then, you will need to delete his Node from the list (Useall methods of deletion Start, Middle, and End). The system will use a special function named asDichargePatient() that will take patient CNIC as parameter, remove node of the patient, and returnsuccess status of the operation.Whenever a new patient is arrived at the hospital for admitting in a room. The system will useanother function AdmitPatient() that takes patient’s information, checks the availability of a room(assume that hospital only have 20 rooms and only one patient per room is allowed). If multiplerooms are available, then always allocate…

Knowledge Booster

Solution Summary: The author explains how to implement a menu-driven program for management of the software store.

Want to see the full answer?

Chapter 6 Solutions