

Need help with this class and function please!!!
#include <iostream>
using namespace std;
class Team {
string teamId;
string name;
string coach;
Team *next;
friend class teamlist;
public:
Team * getNext();
return next;
void setNext(Team *r);
next=r;
string getTeamId();
return teamId;
void setTeamId(string aTeamId);
teamId = aTeamId;
string getName();
return name;
void setName(string aName);
name = aName;
string getCoach();
return coach;
void setCoach(string aCoach);
coach = aCoach;
}
PLEASE DON'T FORGET TO UPVOTE THE ANSWER, IF YOU LIKE IT.
As you have already written the class Team, I am answering the part of the ques asking for the class teamlist.
=========================================================
class teamlist{
Team* head;
Team* tail;
int noOfTeams;
public:
teamlist(){
head=NULL;
tail=NULL;
noOfTeams=0;
}
void addTeam(Team *t){
Team *team=new team(t);
if(head==NULL){
head=team;
tail=team;
}
else{
tail->next=team;
tail=tail->next;
}
noOfTeams++;
}
void readData(char* filename){
ifstream inFile;
inFile.open(filename);
while(!inFile.eof()){
noOfTeams++;
string id,name,coach;
inFile.getline(cin,id);
inFile.getline(cin,name);
inFile.getline(cin,coach);
Team* newteam=new Team();
newteam.setTeamId(id);
newteam.setName(name);
newteam.setCoach(coach);
if(head==NULL){
head=newteam;
tail=newteam;
}
else{
tail->next=newteam;
tail=tail->next;
}
}
}
void printTeams(){
Team* temp=head;
while(temp!=NULL){
cout<<temp->teamId<<endl<<temp->name<<endl<<temp->coach<<endl;
temp=temp->next;
}
}
Team* getTeamRef(string id){
Team* temp=head;
while(temp!=NULL){
if(id.compare(temp->teamId)==0) return temp;
temp=temp->next;
}
return NULL;
}
int getNumTeams(){
return noOfTeams;
}
};
Need help with this class and function please!!! #include <iostream> using namespace std; c...
In C++, change this code to a circular linked list #include <iostream> using namespace std; struct node { string data; node *next; }; class linked_list { private: node *head,*tail; public: linked_list() { head = NULL; tail = NULL; } void add_node(string n) { node *tmp = new node; tmp->data = n; tmp->next = NULL; if(head == NULL) { head = tmp; tail = tmp; } else { tail->next = tmp; tail = tail->next; } } void display() { while (tmp...
USING THIS CODE: #include <iostream> #include <string> using namespace std; class Contact { //this class cannot be viewed from outside of the private class. //only the class functions within the class can access private members. private: string name; string email; string phone; //the public class is accessible from anywhere outside of the class //however can only be within the program. public: string getName() const { return name; } void setName(string name) { this->name = name; } string getEmail() const {...
ICS Quiz need help! open the Node.java file and look at the main() method driver/test method. Towards the end of the method, 5 nodes are instantiated and linked. These are what are printed out in the loop. Your task is to DRAW the structure of those 5 linked nodes using the method from the slides (list of Coins). String objects, Nodes, and pointer links must be shown. You may use software or draw on paper. Upload your drawing or a...
//LinkedList
import java.util.Scanner;
public class PoD
{
public static void main( String [] args )
{
Scanner in = new Scanner( System.in );
LinkedList teamList = new LinkedList();
final int TEAM_SIZE = Integer.valueOf(in.nextLine());
for (int i=0; i<TEAM_SIZE; i++)
{
String newTeamMember = in.nextLine();
teamList.append(newTeamMember);
}
while (in.hasNext())
{
String removeMember = in.nextLine();
teamList.remove(removeMember);
}
System.out.println("FINAL TEAM:");
System.out.println(teamList);
in.close();
System.out.print("END OF OUTPUT");
}
}
===========================================================================================
//PoD
import java.util.NoSuchElementException;
/**
* A listnked list is a sequence of nodes with...
#include "name.h" #include "contact.h" using namespace std; class ContactList; typedef class Node* NodePtr; class Node { Contact item; NodePtr next; friend class ContactList; }; class ContactList { public: ContactList(char* clfile) ; ~ContactList(); void display (ostream & output) const; int insert (Contact record_to_insert); int insert (ContactList contact_list); int remove (Contact record_to_delete); int size () const; int save () const; void find_by_lname (ostream & output, string lname) const; void...
could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head, tail; private int size; public MyLinkedList() { this.head = null; this.tail = null; this.size = 0; } //1.Insert a node at the end of the list public void insert(AnyType data) { Node<AnyType> newNode = new Node(); newNode.data = data; if (head == null) { head = newNode; tail = newNode; head.next = null; tail.next = null; } else { tail.next = newNode; tail =...
C++ comment code Comment the following code #include <iostream> using namespace std; class Node { public: Node(int val); int value; Node* next; }; Node::Node(int val){ value = val; } class List { public: List(); // Uncomment the line below once you're ready List(List &other); void push_front(int value); bool pop_front(int &value); void push_back(int value); bool pop_back(int &value); int at(int index); void insert_at(int index, int value); void remove_at(int index); int size(); private: // other members you may have used Node* head; Node*...
#include <iostream> using namespace std; struct ListNode { float value; ListNode *next; }; ListNode *head; class LinkedList { public: int insertNode(float num); void deleteNode(float num); void destroyList(); void displayList(); LinkedList(void) {head = NULL;} ~LinkedList(void) {destroyList();} }; int LinkedList::insertNode(float num) { struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL; newNode = new ListNode; if(newNode == NULL) { cout << "Error allocating memory for new list member!\n"; return 1; } newNode->value = num; newNode->next = NULL; if(head==NULL) { cout << "List...
Please rewrite this function using recursive function #include using namespace std; struct Node { char ch; Node* next; }; class LinkedList { Node* head; public: LinkedList(); ~LinkedList(); void add(char ch); bool find(char ch); bool del(char ch); friend std::ostream& operator<<(std::ostream& out, LinkedList& list); }; LinkedList::LinkedList() { head = NULL; } LinkedList::~LinkedList() { Node* cur = head, * tmp; while (cur != NULL) { tmp = cur->next; delete cur; cur = tmp; } } void LinkedList::add(char ch) { Node* cur = head,...
Study the recursive instance method length()of MyLinkedList2 class and its associated auxiliary method. Then solve (a), (b), and (c) below in a similar way: (a) Convert the method public Element find(Object obj)of MyLinkedList2 class to a recursive one. Use an auxiliary private method. (b) Convert the method public String toString( )of MyLinkedList2 class to a recursive one such that it returns the string representation of a linked list in the form: {ValueDatum1 valueDatum2 valueDatum3 . . . valueDatumN-1 valueDatumN} Use an auxiliary private method....