In Java, please write the code for the prompt in the following TWO pictures. -Pl

Question

In Java, please write the code for the prompt in the following TWO pictures.

-Please write the program as simply as possible.

-Please read and follow the prompt closely.

-Your program should run.

-Your program should create a username and password, and save this information.

-It should allow previously-created usernames to log in and access their previously-inputted food items.

-Your program should be able to save and display user-inputted food items. I recommend using a bufferedReader/Writer. The tricky part of this is keeping the file associated with the appropriate username.

-Your program MUST implement and use STACK class methods.

-MUST use a separate class to represent Objects for Stack.

-MUST search through Stack at some point.

All of the details of the program can be found in the following pictures. Thank you!

For a variety of reasons, human beings track the food they intake. Assume you are working for a healthcare analytics company, and need to gather information about the eating habits of your clients. You need to create a software that helps in doing your work. For this purpose, you write a meni driven program with the following options: 1. Register client and crcatc clicnt login (clicnt supplics the clicntID and password, and thc clientID must be unique) 2. Login existing client 3. Add a food item client ate 4. Check the complete history of food a client ate in a day in reverse order (all food items listed here from dinner to breakfast) 5. Check all the different types of food items a client ate in a day (all food items listed here only once) 6. Total calories eaten in a day 7. Food with the maximum calorie in a day 8. Food that the client ate maximum number of times in a day 9. Logout

Explanation / Answer

Give a binary search tree and a number, inserts a new node
with the given number in the correct place in the tree.
Returns the new root pointer which the caller should
then use (the standard trick to avoid using reference
parameters).
*/
struct node* insert(struct node* node, int data) {
// 1. If the tree is empty, return a new, single node
if (node == NULL) {
    return(newNode(data));
}
else {
    // 2. Otherwise, recur down the tree
    if (data <= node->data) node->left = insert(node->left, data);
    else node->right = insert(node->right, data);

    return(node); // return the (unchanged) node pointer
}
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.