“GroupHolder” class Program Plan: Import required package. Define “Main” class. Define “GroupHolder” class Create an array list “items” from “GroupHolder” class. Method definition for “findGroupNodeFor” Declare variable using “GroupNode” type. Set node “n” to “null”. Set “found” to “false”. Check condition using “while” loop Compute next node. If “n” equal to “s”, then set “found” to “true”. If found, then returns the value of “n”. Otherwise, returns null. Method definition of “addItem”. Call “findGroupNodeFor” method and store it to a variable “n”. If “n” is null, then add it to “items”. Method definition for “getRepresentative”. Call “findGroupNodeFor” method and store it to a variable “n”. Check condition using “while” loop. Set node to link value at node Finally returns the data at node. Method definition of “getAllRepresentatives”. Create an array list. Add data to “items”. Finally returns the result. Method definition of “inSameGroup”. Assign representative for string “s1” and store result to “r1”. Assign representative for string “s2” and store result to “r2”. Returns result. Method definition of “union” Assign representative for string “s1” and store result to “r1”. Assign representative for string “s2” and store result to “r2”. Check condition. Find group node for “r1” and “r2”. Create “GroupNode” class. Declare required variables. Create constructor for “GroupNode” class. Create parameterized for “GroupNode” class. Define main function. Create object “g” from “GroupHolder” class. Add item to “g” by calling the method “addItem”. Display groups by calling the method “getAllRepresentatives”. Join groups by calling the method “union”. Display groups after performing unions operations. Check “a” and “e” is in same group by calling method “inSameGroup”. Check “a” and “f” is in same group by calling method “inSameGroup”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 10PP

Program Plan Intro

“GroupHolder” class

Program Plan:

Import required package.

Define “Main” class.

Define “GroupHolder” class

Create an array list “items” from “GroupHolder” class.

Method definition for “findGroupNodeFor”

Declare variable using “GroupNode” type.

Set node “n” to “null”.

Set “found” to “false”.

Check condition using “while” loop

Compute next node.

If “n” equal to “s”, then set “found” to “true”.

If found, then returns the value of “n”.

Otherwise, returns null.

Method definition of “addItem”.

Call “findGroupNodeFor” method and store it to a variable “n”.

If “n” is null, then add it to “items”.

Method definition for “getRepresentative”.

Call “findGroupNodeFor” method and store it to a variable “n”.

Check condition using “while” loop.

Set node to link value at node

Finally returns the data at node.

Method definition of “getAllRepresentatives”.

Create an array list.

Add data to “items”.

Finally returns the result.

Method definition of “inSameGroup”.

Assign representative for string “s1” and store result to “r1”.

Assign representative for string “s2” and store result to “r2”.

Returns result.

Method definition of “union”

Assign representative for string “s1” and store result to “r1”.

Assign representative for string “s2” and store result to “r2”.

Check condition.

Find group node for “r1” and “r2”.

Create “GroupNode” class.

Declare required variables.

Create constructor for “GroupNode” class.

Create parameterized for “GroupNode” class.

Define main function.

Create object “g” from “GroupHolder” class.

Add item to “g” by calling the method “addItem”.

Display groups by calling the method “getAllRepresentatives”.

Join groups by calling the method “union”.

Display groups after performing unions operations.

Check “a” and “e” is in same group by calling method “inSameGroup”.

Check “a” and “f” is in same group by calling method “inSameGroup”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Provide full C++ code Building a playlist (of songs) using a linked list and making some operations such as adding songs, removing songs, shuffling them, etc. (Some parts of this lab will closely follow lab 08 - it is imperative that you complete that lab before working on this project). A Node representing a song has the following data members (similar to struct Node of lab 08, except it doesn't have one member for storing data): string uniqueID string songName string artistName int songLength Node* nextNodePtr Your code must have the following three files: Playlist.h - Class declaration for a linked list of Nodes (very similar to lab 08 but with some changes to methods, as described below) with following private data members: private:Node* first;Node* last;int size; Playlist.cpp - Class definition main.cpp - main() function Checkpoint A For checkpoint A, you need to build a playlist (of songs) by readings data members of several songs from a file and printing them. Implement…

Please, help me to do this in Java. Create a program to view the waiting list. The list (5 entries) is created in the program and is an object of the LinkedList class. The list entry is a QueuePerson object that contains the queue's last name, first name, and patronymic fields (of type String), an AddressValue field for the queue's address, and queue priority (int type). In turn, the field of the AddressValue type contains three fields of the String type: the name of the city, the name of the street and the house number, as well as an int type field - the apartment number (if the apartment number is 0, the house in which the subject lives does not have apartments). Entries in the queue are sorted according to priority, and the queue is added last in the queue of its priority. Provide the possibility of receiving so that there is no repetition in the queue by the name of the person on the waiting list, for which use TreeSet.

Explain this code by putting comments in detail. Language used is c++. Topic is Linkedlist // void deleteByData(int data) { // if(head->data == data) { // head = head->next; // } // next = head; // Node *prev = next; // while (next != NULL) { // if (next->data == data) { // prev->next = prev->next->next; // } // prev = next; // next = next->next; // } // }; };