Question

in C++, please help. Not only do we need to create an ADT but create a main file as well to implement everything. For this program you will be creating a stack ADT to allow the client program to pick up treasures for a Star Wars scavenger game to get everyone ready for the opening of Galaxy’s Edge in 2020. Each treasure should have a (a) name, (b) description, (c) category, (d) what it is used for, and (e)if this is something the user wants to keep after the treasure hunt is over. You might also want to include which civilization the item is from. Each person doing the treasure hunt must find something in each of the following categories:

1.Food(3)

2.Weapon (1)

3.Clothing(2)

4.Artifact(2)

5.Pick one other

The stack will be implemented using a flexible array (a linear linked list of arrays). Each element of the array will be a treasure. Create an ordered list to keep track of the required categories (don’t just hard code these) using any data structure you would like (array, linear linked list, or other). For the stack, implement push, pop, peek, and is_empty. Please keep in mind that because we are creating ADTs, the user of the program must not be aware that a stack and ordered list is being used –this is the job of the application program(your test program)!

Please keep in mind that because we are creating ADTs, the

user of the program must not be aware that a stack and ordered list is being used –this is the job of the application program(your test program)! Things you should know...as part of your program:

1)Do not use statically allocated arrays in your classes or structures.The client may use them.

2)All data members in a class must be private

3)Never perform input operations from your class in CS163

4)Global variables are not allowed in CS163

5)Do not use the String class! (use arrays of characters instead!) You may use the cstring class.

6) Use modular design, separating the .h files from the .cpp files. Remember, .h files should contain the class header and any necessary prototypes. The .cpp files should contain function definitions. You must have at least 1.h file and 2.cpp

files. Never "#include" .cpp files!

7)Use the iostream library for all I/O; do not use stdio.h.

8)Make sure to define a   constructor and destructor for your class. Your destructor must deallocate all dynamically allocated memory.

Answer 1

#include "Stack.h" #include <iostream> #include <string> using namespace std; class Treasure { public:    Treasure() = default;    Treasure(string name, string description, string category, string use, bool keep)    {        this->name = name;        this->description = description;        this->category = category;        this->use = use;        this->keep = keep;    }    string name;    string description;    string category;    string use;    bool keep;    friend ostream& operator<<(ostream& os, const Treasure& Obj); }; ostream& operator<<(ostream& os, const Treasure& Obj) {    cout << "Name: " << Obj.name << endl;    cout << "Description: " << Obj.description << endl;    cout << "Category: " << Obj.category << endl;    cout << "Use: " << Obj.use << endl;    cout << "Keep?: " << Obj.keep << endl << endl;    return os; } int main() {    // Stack Test!. Passed!.    /*    Stack<int> S;    S.display();    S.Pop();    S.display();    S.Push(1);    S.display();    S.Push(2);    S.display();    S.Push(3);    S.display();    S.Pop();    S.display();    S.Pop();    S.display();    S.Pop();    S.display();    S.Pop();    S.display();    */       Treasure T1("A", "B", "C", "D", false);    Treasure T2("E", "F", "G", "H", false);    Treasure T3("I", "J", "K", "L", true);    Stack<Treasure> S2;    S2.Push(T1);    cout << S2.Top();    S2.Push(T2);    cout << S2.Top();    S2.Push(T3);    cout << S2.Top();    S2.Pop();    cout << S2.Top();    return 0; }

#pragma once #include"LinkedList.h" #include <iostream> using namespace std; template <typename T> class Stack { private:    LinkedList<T>Pointer; public:    // Cinstructor For Stacks    Stack() = default;    // Returns If Stack is Having Any Vacant Slot To Push A Value!.    bool IsStackEmpty() const { return Pointer.IsEmptyList(); }    // Push A Value To The Next Index Of Stack!.    void Push(T N) { Pointer.InsertAtHead(N); }    // Move Back And Index, No Need To Change The Value As It Can Be OverWritten Next Time Push Is Called!.    void Pop() { Pointer.DeleteFromHead(); }    // Returns Top Most Value Of The Stack!.    T Top() { return Pointer.GetHead()->GetData(); }    void display() { Pointer.Print(); }       // Destructor For Stack!.    ~Stack() = default; };

#pragma once #include"Node.h" #include<iostream> using namespace std; template <typename T> class LinkedList // LinkedList Using Head And Tail. { private:    // Top / Front / Head.    Node<T>*Head;    // Tail / Back / Current.    Node<T>*Current;    // Set Head As It Is A Private Member.    void SetHead(Node<T> *Val) { this->Head = Val; }    // Set Tail As It Is A Private Member.    void SetCurrent(Node<T> *Val) { this->Current = Val; }    // Get Tail As It Is A Private Member.    Node<T>* GetCurrent() { return this->Current; } public:    // Get Head As It Is A Public Member.    Node<T>* GetHead() { return this->Head; }    // Constructor Sets Head And Tail To Null.    LinkedList() { SetHead(NULL); SetCurrent(NULL); }    // Copy Constructor.    LinkedList(LinkedList &obj) // Yes , I Googled This! , Used To Make A New Copy Of Linked List When Passing It To A Function Without Reference So The Orignal List Is Does Not Get Deleted!.    {        Node<T>dummy;        for (Node<T>* o = obj.GetHead(), *n = &dummy; o; o = o->GetNext())        {            n->SetNext(new Node<T>(o->GetData()));            n = n->GetNext();        }        this->Head = dummy.GetNext();    }    // Returns If List Is Empty Or Not.    bool IsEmptyList() { if (GetHead() == NULL) return true; return false; }    // Returns The Data Of Current List From Head.    T GetHeadData() { return GetHead()->GetData(); }    // Returns The Data Of Current List From Tail.    T GetTailData() { return GetCurrent()->GetData(); }    // Prints The Current List From Head To Tail.    void Print()    {        Node<T>*Temp = GetHead();        cout << "Current List : ";        while (Temp != NULL)        {            cout << Temp->GetData() << " ";            Temp = Temp->GetNext();        }        cout << endl;    }    // Inserts The New Value At Head.    void InsertAtHead(T Val)    {        Node<T>*Temp = new Node<T>;        Temp->SetData(Val);        Temp->SetNext(this->Head);        if (GetHead() == NULL)        {            SetHead(Temp);            SetCurrent(Head);        }        else        {            Temp->SetNext(GetHead());            SetHead(Temp);        }    }    // Inserts The New Value At Tail.    void InsertAtTail(T Val)    {        Node<T>*Temp = new Node<T>;        Temp->SetData(Val);        Temp->SetNext(NULL);        if (Head == NULL)        {            SetHead(Temp);            SetCurrent(Head);        }        else        {            GetCurrent()->SetNext(Temp);            SetCurrent(Temp);        }    }    // Deletes The Value At Head.    void DeleteFromHead()    {        if (!IsEmptyList())        {            if (GetHead()->GetNext() != NULL)            {                Node<T>*Temp = GetHead();                SetHead(GetHead()->GetNext());                delete Temp;            }            else            {                Node<T>*Temp = GetHead();                delete Temp;                SetHead(NULL);            }        }      }    // Deletes The Value At Tail.    void DeleteFromTail()    {        if (!IsEmptyList())        {            SetCurrent(GetHead());            if (GetCurrent() == GetHead() && GetCurrent()->GetNext() == NULL)            {                delete GetCurrent();                SetHead(NULL);            }            else            {                while (GetCurrent()->GetNext()->GetNext() != NULL)                {                    SetCurrent(GetCurrent()->GetNext());                }                delete GetCurrent()->GetNext();                GetCurrent()->SetNext(NULL);            }        }    }    // Searches The List For A Value, And Returns The Address Of Node Which Contains The Value.    Node<T>* Search(T Val)    {        SetCurrent(GetHead());        if (IsEmptyList()) return NULL;        else        {            while (GetCurrent() != NULL)            {                if (GetCurrent()->GetData() == Val) return GetCurrent();                SetCurrent(GetCurrent()->GetNext());            }            return NULL;        }    }    // Insert A Value, After A Specific Value.    void InsertAfter(T Check, T Val)    {        SetCurrent(GetHead());        Node<T>* Ptr = Search(Check);        if (!Ptr) cout << "Value Not Found!" << endl;        else        {            Node<T>* Temp = new Node<T>;            Temp->SetData(Val);            Temp->SetNext(Ptr->GetNext());            Ptr->SetNext(Temp);        }    }    // Insert A Value, Before A Specific Value.    void InsertBefore(T Check, T Val)    {        SetCurrent(GetHead());        Node<T>* Ptr = Search(Check);        if (!Ptr) cout << "Value Not Found!" << endl;        else        {            Node<T>* Temp = new Node<T>;            Temp->SetData(Ptr->GetData());            Ptr->SetData(Val);            Temp->SetNext(Ptr->GetNext());            Ptr->SetNext(Temp);        }    }      // Sorts The List Value By Value In Descending, Not Node By Node, Until The List Is Fully In Order.    void SortDescending()    {        Node<T>* Temp;        bool Swap = true;        while(Swap)        {            Swap = false;            SetCurrent(Head);            while (GetCurrent())            {                Temp = GetCurrent();                SetCurrent(GetCurrent()->GetNext());                if (GetCurrent() && Current->GetData() > Temp->GetData())                {                    Swap = true;                    T Val;                    Val = Temp->GetData();                    Temp->SetData(GetCurrent()->GetData());                    GetCurrent()->SetData(Val);                }            }        }    }    // Sorts The List Value By Value In Ascending, Not Node By Node, Until The List Is Fully In Order.    void SortAscending()    {        Node<T>* Temp;        bool Swap = true;        while (Swap)        {            Swap = false;            SetCurrent(Head);            while (GetCurrent())            {                Temp = GetCurrent();                SetCurrent(GetCurrent()->GetNext());                if (GetCurrent() && Current->GetData() < Temp->GetData())                {                    Swap = true;                    T Val;                    Val = Temp->GetData();                    Temp->SetData(GetCurrent()->GetData());                    GetCurrent()->SetData(Val);                }            }        }    }    // Default Destructor.    ~LinkedList() = default; };

#pragma once template <typename T> class Node { private:    T Data;    Node* Next; public:    T GetData() { return this->Data; }    void SetData(T Val) { this->Data = Val; }    Node* GetNext() { return this->Next; }    void SetNext(Node* Val) { this->Next = Val; }    // SetData Cannot Be NULL For Some Structs, So Remove This Statement.    Node() { this->SetNext(nullptr); }    Node(T Val) { this->SetData(Val); }    ~Node() = default; };

IF THERE IS ANY PROBLEM OR YOU HAVE ANY QUERY REGARDING THE SOLUTION KINDLY FEEL FREE TO ASK, AND LEAVE A THUMBS UP WHEN YOU ARE SATISFIED. THANKS!.