Define a class called Player that implements Comparable <Player> with health and name attributes and has getter/setter methods to retrieve/access them. Define the appropriate constructors and give it a useful toString() method. Define a class called LinkedList with an inner nested class Node. The Node class has private attributes(Player player; Node next;). Define the appropriate constructor and toString() methods. Class LinkedList has two attributes (Node head and int size). Define the following LinkedList methods: insert(Player p); remove(Player p); toString(); NOTE: your insert() method must be ordered. This means that your newly added Node should be placed in an ordered fashion such that you resulting linked list is ALWAYS sorted by the players’s health. For example: If Player p has health 2000, then insert() will produce the following linked list: p -> null If Player p2 has health 1000, then insert() will produce the following linked list: p2->p->null If Player p3 has health 500, then insert() will produce the following linked list: P3->p2->p->null If Player p4 has health 5000, then insert() will produce the following linked list: p3->p2->p->p4-> null NOTE 2: YOU SHOULD ALWAYS MAINTAIN ENCAPSULATION! Do NOT insert the Player argument, insert a copy/clone of the Player. Create a Driver program to test your application.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Define a class called Player that implements Comparable <Player> with health and name attributes and has getter/setter methods to retrieve/access them. Define the appropriate constructors and give it a useful toString() method.
Define a class called LinkedList with an inner nested class Node.
The Node class has private attributes(Player player; Node next;). Define the appropriate constructor and toString() methods.
Class LinkedList has two attributes (Node head and int size).
Define the following LinkedList methods:

insert(Player p); remove(Player p); toString();

NOTE: your insert() method must be ordered. This means that your newly added Node should be placed in an ordered fashion such that you resulting linked list is ALWAYS sorted by the players’s health.

For example:

If Player p has health 2000, then insert() will produce the following linked list: p -> null
If Player p2 has health 1000, then insert() will produce the following linked list: p2->p->null
If Player p3 has health 500, then insert() will produce the following linked list:

P3->p2->p->null

If Player p4 has health 5000, then insert() will produce the following linked list: p3->p2->p->p4-> null

NOTE 2: YOU SHOULD ALWAYS MAINTAIN ENCAPSULATION! Do NOT insert the Player argument, insert a copy/clone of the Player.
Create a Driver program to test your application.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 6 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions