From ecdb490c35ff5c9d3e0b14d5fe4e996f3ec2868d Mon Sep 17 00:00:00 2001
From: tiennm99 <tiennm99@outlook.com>
Date: Sun, 21 Dec 2025 10:50:53 +0700
Subject: [PATCH] chore: migrate

---
 .gitignore     |  41 ++++++++
 List.cpp       | 265 +++++++++++++++++++++++++++++++++++++++++++++++++
 Nhut/List.cpp  | 265 +++++++++++++++++++++++++++++++++++++++++++++++++
 Nhut/List.h    |  39 ++++++++
 Nhut/Poly.cpp  |  41 ++++++++
 Nhut/Queue.cpp |  23 +++++
 Nhut/Queue.h   |  18 ++++
 Nhut/Stack.cpp |  23 +++++
 Nhut/Stack.h   |  18 ++++
 Poly           | Bin 0 -> 19392 bytes
 Poly.cpp       |  41 ++++++++
 Queue.cpp      |  23 +++++
 Queue.h        |  18 ++++
 Stack.cpp      |  23 +++++
 Stack.h        |  18 ++++
 makefile       |  12 +++
 16 files changed, 868 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 List.cpp
 create mode 100644 Nhut/List.cpp
 create mode 100644 Nhut/List.h
 create mode 100644 Nhut/Poly.cpp
 create mode 100644 Nhut/Queue.cpp
 create mode 100644 Nhut/Queue.h
 create mode 100644 Nhut/Stack.cpp
 create mode 100644 Nhut/Stack.h
 create mode 100644 Poly
 create mode 100644 Poly.cpp
 create mode 100644 Queue.cpp
 create mode 100644 Queue.h
 create mode 100644 Stack.cpp
 create mode 100644 Stack.h
 create mode 100644 makefile

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..d4fb281
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,41 @@
+# Prerequisites
+*.d
+
+# Compiled Object files
+*.slo
+*.lo
+*.o
+*.obj
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Linker files
+*.ilk
+
+# Debugger Files
+*.pdb
+
+# Compiled Dynamic libraries
+*.so
+*.dylib
+*.dll
+
+# Fortran module files
+*.mod
+*.smod
+
+# Compiled Static libraries
+*.lai
+*.la
+*.a
+*.lib
+
+# Executables
+*.exe
+*.out
+*.app
+
+# debug information files
+*.dwo
diff --git a/List.cpp b/List.cpp
new file mode 100644
index 0000000..8b6c81f
--- /dev/null
+++ b/List.cpp
@@ -0,0 +1,265 @@
+#include "List.h"
+#include "Queue.h"
+#include "Stack.h"
+
+List::List()
+{
+    pHead = NULL;
+    count = 0;
+}
+
+void List::addLast(int newdata)
+{
+    Node *pNew = new Node;
+    pNew->data = newdata;
+    if (pHead == NULL)
+    {
+        pHead = pNew;
+        ++count;
+        return;
+    }
+    Node *pTemp = pHead;
+    while (pTemp->next != NULL)
+    {
+        pTemp = pTemp->next;
+    }
+    pTemp->next = pNew;
+    ++count;
+}
+
+void List::addConstant(int nConstant)
+{
+    Node *pTemp = pHead;
+    if (pTemp == NULL)
+        return;
+    while (pTemp->next != NULL)
+        pTemp = pTemp->next;
+    pTemp->data += nConstant;
+    return;
+}
+
+void List::addFirst(int newdata)
+{
+    Node *pTemp = new Node;
+    pTemp->data = newdata;
+    pTemp->next = pHead;
+    pHead = pTemp;
+    count++;
+}
+
+void List::display()
+{
+    Node *pTemp = pHead;
+    while (pTemp != NULL)
+    {
+        cout << pTemp->data << " ";
+        pTemp = pTemp->next;
+    }
+    cout << endl;
+}
+
+void List::displayPoly()
+{
+    Node *pTemp = pHead;
+    int i = 0;
+    while (pTemp != NULL)
+    {
+        int index = count - 1 - i;
+        if (pTemp->data != 0)
+        {
+            if (pTemp->data > 0)
+            {
+                if (i != 0)
+                    cout << "+";
+            }
+            cout << pTemp->data;
+            if (index == 1)
+                cout << "x";
+            else if (index > 1)
+                cout << "x^" << index;
+        }
+        ++i;
+        pTemp = pTemp->next;
+    }
+    cout << endl;
+}
+
+void List::removeFirst()
+{
+    if (pHead == NULL)
+        return;
+    Node *pDel = pHead;
+    pHead = pHead->next;
+    delete pDel;
+    --count;
+}
+
+void List::removeLast()
+{
+    if (pHead == NULL)
+        return;
+    Node *pTemp = pHead;
+    if (count == 1)
+    {
+        pHead = NULL;
+        delete pTemp;
+        count = 0;
+        return;
+    }
+    Node *pPrev = NULL;
+    while (pTemp->next != NULL)
+    {
+        pPrev = pTemp;
+        pTemp = pTemp->next;
+    }
+    pPrev->next = NULL;
+    delete pTemp;
+    --count;
+}
+
+int List::returnFirst()
+{
+    if (pHead == NULL)
+        return 0;
+    return pHead->data;
+}
+
+int List::returnLast()
+{
+    if (pHead == NULL)
+        return 0;
+    Node *pTemp = pHead;
+    while (pTemp->next != NULL)
+        pTemp = pTemp->next;
+    return pTemp->data;
+}
+
+List::~List()
+{
+    Node *pTemp = pHead;
+    while (pTemp != NULL)
+    {
+        pTemp = pTemp->next;
+        delete pHead;
+        pHead = pTemp;
+    }
+}
+
+List *addPoly(List *list1, List *list2)
+{
+    if (list1 == NULL || list2 == NULL)
+        return NULL;
+    int i = list1->count,
+        j = list2->count;
+    Node *pHead1 = list1->pHead;
+    Node *pHead2 = list2->pHead;
+    if (i <= 0 || j <= 0)
+        return NULL;
+    if (i > j)
+    {
+        while (i > j)
+        {
+            pHead1 = pHead1->next;
+            --i;
+        }
+    }
+    else
+    {
+        while (j > i)
+        {
+            pHead2 = pHead2->next;
+            --j;
+        }
+    }
+    List *ret = new List;
+    while (i > 0)
+    {
+        int t = pHead1->data + pHead2->data;
+        ret->addLast(t);
+        pHead1 = pHead1->next;
+        pHead2 = pHead2->next;
+        --i;
+    }
+    return ret;
+}
+
+List *reverseListWithStack(List *list)
+{
+    if (list == NULL)
+        return NULL;
+    Node *pTemp = list->pHead;
+    Stack *stack = new Stack;
+    int count = 0;
+    while (pTemp != NULL)
+    {
+        stack->push(pTemp->data);
+        pTemp = pTemp->next;
+        ++count;
+    }
+    List *ret = new List;
+    while (count > 0)
+    {
+        ret->addLast(stack->pop());
+        --count;
+    }
+    return ret;
+}
+
+List *reverseListWithQueue(List *list)
+{
+    if (list == NULL)
+        return NULL;
+    Node *pTemp = list->pHead;
+    Queue *queue = new Queue;
+    int count = 0;
+    while (pTemp != NULL)
+    {
+        queue->enQueue(pTemp->data);
+        pTemp = pTemp->next;
+        ++count;
+    }
+    List *ret = new List;
+    while (count > 0)
+    {
+        ret->addFirst(queue->deQueue());
+        --count;
+    }
+    return ret;
+}
+
+List *appendList(List *list1, List *list2)
+{
+    List *ret;
+    if (list2 == NULL)
+    {
+        ret = list1;
+    }
+    else if (list1 == NULL)
+    {
+        ret = list2;
+    }
+    else
+    {
+        Node *pTemp;
+        ret = new List;
+        pTemp = list1->pHead;
+        while (pTemp != NULL)
+        {
+            ret->addLast(pTemp->data);
+            pTemp = pTemp->next;
+            list1->removeFirst();
+        }
+        pTemp = list2->pHead;
+        while (pTemp != NULL)
+        {
+            ret->addLast(pTemp->data);
+            pTemp = pTemp->next;
+            list2->removeFirst();
+        }
+    }
+    delete list1;
+    list1 = NULL;
+    delete list2;
+    list2 = NULL;
+    return ret;
+}
diff --git a/Nhut/List.cpp b/Nhut/List.cpp
new file mode 100644
index 0000000..8b6c81f
--- /dev/null
+++ b/Nhut/List.cpp
@@ -0,0 +1,265 @@
+#include "List.h"
+#include "Queue.h"
+#include "Stack.h"
+
+List::List()
+{
+    pHead = NULL;
+    count = 0;
+}
+
+void List::addLast(int newdata)
+{
+    Node *pNew = new Node;
+    pNew->data = newdata;
+    if (pHead == NULL)
+    {
+        pHead = pNew;
+        ++count;
+        return;
+    }
+    Node *pTemp = pHead;
+    while (pTemp->next != NULL)
+    {
+        pTemp = pTemp->next;
+    }
+    pTemp->next = pNew;
+    ++count;
+}
+
+void List::addConstant(int nConstant)
+{
+    Node *pTemp = pHead;
+    if (pTemp == NULL)
+        return;
+    while (pTemp->next != NULL)
+        pTemp = pTemp->next;
+    pTemp->data += nConstant;
+    return;
+}
+
+void List::addFirst(int newdata)
+{
+    Node *pTemp = new Node;
+    pTemp->data = newdata;
+    pTemp->next = pHead;
+    pHead = pTemp;
+    count++;
+}
+
+void List::display()
+{
+    Node *pTemp = pHead;
+    while (pTemp != NULL)
+    {
+        cout << pTemp->data << " ";
+        pTemp = pTemp->next;
+    }
+    cout << endl;
+}
+
+void List::displayPoly()
+{
+    Node *pTemp = pHead;
+    int i = 0;
+    while (pTemp != NULL)
+    {
+        int index = count - 1 - i;
+        if (pTemp->data != 0)
+        {
+            if (pTemp->data > 0)
+            {
+                if (i != 0)
+                    cout << "+";
+            }
+            cout << pTemp->data;
+            if (index == 1)
+                cout << "x";
+            else if (index > 1)
+                cout << "x^" << index;
+        }
+        ++i;
+        pTemp = pTemp->next;
+    }
+    cout << endl;
+}
+
+void List::removeFirst()
+{
+    if (pHead == NULL)
+        return;
+    Node *pDel = pHead;
+    pHead = pHead->next;
+    delete pDel;
+    --count;
+}
+
+void List::removeLast()
+{
+    if (pHead == NULL)
+        return;
+    Node *pTemp = pHead;
+    if (count == 1)
+    {
+        pHead = NULL;
+        delete pTemp;
+        count = 0;
+        return;
+    }
+    Node *pPrev = NULL;
+    while (pTemp->next != NULL)
+    {
+        pPrev = pTemp;
+        pTemp = pTemp->next;
+    }
+    pPrev->next = NULL;
+    delete pTemp;
+    --count;
+}
+
+int List::returnFirst()
+{
+    if (pHead == NULL)
+        return 0;
+    return pHead->data;
+}
+
+int List::returnLast()
+{
+    if (pHead == NULL)
+        return 0;
+    Node *pTemp = pHead;
+    while (pTemp->next != NULL)
+        pTemp = pTemp->next;
+    return pTemp->data;
+}
+
+List::~List()
+{
+    Node *pTemp = pHead;
+    while (pTemp != NULL)
+    {
+        pTemp = pTemp->next;
+        delete pHead;
+        pHead = pTemp;
+    }
+}
+
+List *addPoly(List *list1, List *list2)
+{
+    if (list1 == NULL || list2 == NULL)
+        return NULL;
+    int i = list1->count,
+        j = list2->count;
+    Node *pHead1 = list1->pHead;
+    Node *pHead2 = list2->pHead;
+    if (i <= 0 || j <= 0)
+        return NULL;
+    if (i > j)
+    {
+        while (i > j)
+        {
+            pHead1 = pHead1->next;
+            --i;
+        }
+    }
+    else
+    {
+        while (j > i)
+        {
+            pHead2 = pHead2->next;
+            --j;
+        }
+    }
+    List *ret = new List;
+    while (i > 0)
+    {
+        int t = pHead1->data + pHead2->data;
+        ret->addLast(t);
+        pHead1 = pHead1->next;
+        pHead2 = pHead2->next;
+        --i;
+    }
+    return ret;
+}
+
+List *reverseListWithStack(List *list)
+{
+    if (list == NULL)
+        return NULL;
+    Node *pTemp = list->pHead;
+    Stack *stack = new Stack;
+    int count = 0;
+    while (pTemp != NULL)
+    {
+        stack->push(pTemp->data);
+        pTemp = pTemp->next;
+        ++count;
+    }
+    List *ret = new List;
+    while (count > 0)
+    {
+        ret->addLast(stack->pop());
+        --count;
+    }
+    return ret;
+}
+
+List *reverseListWithQueue(List *list)
+{
+    if (list == NULL)
+        return NULL;
+    Node *pTemp = list->pHead;
+    Queue *queue = new Queue;
+    int count = 0;
+    while (pTemp != NULL)
+    {
+        queue->enQueue(pTemp->data);
+        pTemp = pTemp->next;
+        ++count;
+    }
+    List *ret = new List;
+    while (count > 0)
+    {
+        ret->addFirst(queue->deQueue());
+        --count;
+    }
+    return ret;
+}
+
+List *appendList(List *list1, List *list2)
+{
+    List *ret;
+    if (list2 == NULL)
+    {
+        ret = list1;
+    }
+    else if (list1 == NULL)
+    {
+        ret = list2;
+    }
+    else
+    {
+        Node *pTemp;
+        ret = new List;
+        pTemp = list1->pHead;
+        while (pTemp != NULL)
+        {
+            ret->addLast(pTemp->data);
+            pTemp = pTemp->next;
+            list1->removeFirst();
+        }
+        pTemp = list2->pHead;
+        while (pTemp != NULL)
+        {
+            ret->addLast(pTemp->data);
+            pTemp = pTemp->next;
+            list2->removeFirst();
+        }
+    }
+    delete list1;
+    list1 = NULL;
+    delete list2;
+    list2 = NULL;
+    return ret;
+}
diff --git a/Nhut/List.h b/Nhut/List.h
new file mode 100644
index 0000000..6bffad1
--- /dev/null
+++ b/Nhut/List.h
@@ -0,0 +1,39 @@
+#ifndef LIST_H
+#define LIST_H
+
+#include <iostream>
+
+using namespace std;
+
+class Node
+{
+public:
+  int data;
+  Node *next;
+};
+
+class List
+{
+private:
+  int count;
+  Node *pHead;
+
+public:
+  List();
+  void addLast(int);
+  void addConstant(int);
+  void addFirst(int);
+  void removeFirst();
+  void removeLast();
+  int returnFirst();
+  int returnLast();
+  void display();
+  void displayPoly();
+  friend List *addPoly(List *, List *);
+  friend List *reverseListWithStack(List *);
+  friend List *reverseListWithQueue(List *);
+  friend List *appendList(List *, List *);
+  ~List();
+};
+
+#endif // LIST_H
\ No newline at end of file
diff --git a/Nhut/Poly.cpp b/Nhut/Poly.cpp
new file mode 100644
index 0000000..5ab000f
--- /dev/null
+++ b/Nhut/Poly.cpp
@@ -0,0 +1,41 @@
+#include "List.h"
+#include "Queue.h"
+#include "Stack.h"
+#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    List *myList1 = new List,
+         *myList2 = new List;
+    myList1->addFirst(1);
+    myList1->addFirst(0);
+    myList1->addFirst(1);
+    myList1->addFirst(0);
+    myList1->addFirst(5);
+    myList1->display();
+    myList2->addFirst(1);
+    myList2->addFirst(2);
+    myList2->addFirst(3);
+    myList2->display();
+    myList1->displayPoly();
+    myList2->displayPoly();
+    List *result = addPoly(myList1, myList2);
+    myList1->display();
+    myList2->display();
+    if (result != NULL)
+        result->display();
+    myList1->display();
+    myList2->display();
+    myList1->displayPoly();
+    myList2->displayPoly();
+    result->displayPoly();
+    cout << myList1->returnFirst() << endl;
+    myList1->removeFirst();
+    myList1->display();
+    cout << myList1->returnLast() << endl;
+    myList1->removeLast();
+    myList1->display();
+    return 0;
+}
\ No newline at end of file
diff --git a/Nhut/Queue.cpp b/Nhut/Queue.cpp
new file mode 100644
index 0000000..afdddec
--- /dev/null
+++ b/Nhut/Queue.cpp
@@ -0,0 +1,23 @@
+#include "Queue.h"
+
+Queue::Queue()
+{
+    queue = new List;
+}
+
+void Queue::enQueue(int newdata)
+{
+    queue->addLast(newdata);
+}
+
+int Queue::deQueue()
+{
+    int ret = queue->returnFirst();
+    queue->removeFirst();
+    return ret;
+}
+
+Queue::~Queue()
+{
+    delete queue;
+}
\ No newline at end of file
diff --git a/Nhut/Queue.h b/Nhut/Queue.h
new file mode 100644
index 0000000..c41d82e
--- /dev/null
+++ b/Nhut/Queue.h
@@ -0,0 +1,18 @@
+#ifndef QUEUE_H
+#define QUEUE_H
+
+#include "List.h"
+
+class Queue
+{
+  private:
+    List *queue;
+
+  public:
+    Queue();
+    void enQueue(int);
+    int deQueue();
+    ~Queue();
+};
+
+#endif // QUEUE_H
\ No newline at end of file
diff --git a/Nhut/Stack.cpp b/Nhut/Stack.cpp
new file mode 100644
index 0000000..a0b702e
--- /dev/null
+++ b/Nhut/Stack.cpp
@@ -0,0 +1,23 @@
+#include "Stack.h"
+
+Stack::Stack()
+{
+    stack = new List;
+}
+
+void Stack::push(int newdata)
+{
+    stack->addFirst(newdata);
+}
+
+int Stack::pop()
+{
+    int ret = stack->returnFirst();
+    stack->removeFirst();
+    return ret;
+}
+
+Stack::~Stack()
+{
+    delete stack;
+}
\ No newline at end of file
diff --git a/Nhut/Stack.h b/Nhut/Stack.h
new file mode 100644
index 0000000..447f69b
--- /dev/null
+++ b/Nhut/Stack.h
@@ -0,0 +1,18 @@
+#ifndef STACK_H
+#define STACK_H
+
+#include "List.h"
+
+class Stack
+{
+private:
+  List *stack;
+
+public:
+  Stack();
+  void push(int);
+  int pop();
+  ~Stack();
+};
+
+#endif // STACK_H
\ No newline at end of file
diff --git a/Poly b/Poly
new file mode 100644
index 0000000000000000000000000000000000000000..76f4e66b56731e9f7c61a630382f908afd57f0b0
GIT binary patch
literal 19392
zcmeHPeRNyJl^@A=;(TB$As=qCB!UKNAQp0P64OwSV=Ixt32tncBw(HuONmu%$+ez>
zokP-qfufp^z;fEO`$4wbc6YmNNxLkYw!2OsDTdvgT^CYFmjZ4ZTDhjIDS>(^;Qig1
zJ5Nut1RVD4KYKhr(w+M`ckbMo_cZT~KkskY;B+{IE>3ZkAj~_<CrRpCh-0-9Wm>hE
zC49my&J#00DZ<AmIRsTr!wEL6VKK`U02bm??No$nr%zTi{1ZhM8fp&-QhVv*<Enx`
zTc%JA1-zs}dgSYH1z`l+GT;&RBSntM;+Ee;CcR>hL;>4mMZ<A+Ohes2>KlEU*>1Db
z2aIqZ0Z}Kv(~xATG`?bnsO~P4D4<VPG+fE;X{hx+4L$Pn!xk3{ZsGRw#l_41Ysk%u
z%Q_=F)>K{A8LH@vL=(Lgz13?f)>L`oG0!U5Z?aFa8#lMemUJB5z{uwX_)w^ce|9)E
z<B2<8eDFUPEPnaWqi64aY-DtlcqRCd4b?A~IN#xt%@e&8pYz{6JFDFP(}o2H=hpVs
z-~1Rzc}qPs=jY&(pY9y=<$36T19~nyqj~6G$kXngJoL-+v^z78{B?QcZ_DEkP4!&<
z2lLRs%XUVJeW;~N1XZ$gIE#KY?93BO#UXE-6jmc9#Dgq9o+U4kM{zUMe(9x@J8Oht
z?COd|jkp=?F%3f)*X%a7gm*>aX1J%eGZ>GD<HD$K-eiQrJxp%iRNEPghMR*sI>U;W
zo3nj$lUW^!#f=@oc(|%Q8ZqlC{kw$$daN_<Z``n@Db{58$%EcrqdVLak41x>5wp+O
z?S)jRvyp_G%&KrS)LGx&WL8$TcLaM3vnLoa<Mr)+{}#|LhxJIi5sRBW;b2#Nv(fA|
z{7q}nld0|3s`jI|bV<XV@%j&Ew7nT7R~wDjwkwC)V+m8*r+!2zqPyDLjW`9gQW!1K
zTO!dAq8Lwfg^Ag&Bi-H`G=gThHv(;g7##MlU?eIw*47%Ad%R*}L;d<%W0hx>XSJx^
zy0vC~y;148T#>hKg-8`fRxJ`vzydj|2`8*bemgPa9r$ZPZs_^ecv0URTFJix8WrMq
z+xUqkky*4t{FTLbLPF`2{IieTjLSfw_zvrs7e9!l*C~#${KRE#BqrAmUcw}<^OCM1
zdJQB-8RzRv)Y$})h1*8gYc0{sZFKwf$ZMn9*W+p%o!ZdFXQR`arc1y^M<A@yXrm*5
zR@rK!)B31On~gqC69GGH^tm>Aw~c;|jUMQKwKy<P^y5#sMc~e3W>M-_U<Ue66d$(<
zp*p$x`w*GD@KJo1F885Ecn1lMj!dFl_$|UI#G}I!{~F;mM5D(f{#C+h`5!$j@dpW~
z(2pLH_!kMMkdGda`0a$xAbh{X_Yh7Y9_^NR58-rK9&MBOX9=f}jy6hs2jQ~`_ep#^
z;S}0Yuf(6Z$Srmr04_`A@9L93xhatRWuX7ecw=+@&@q84bYST51B(d^&0pvfskKl%
zyR&q8oe)RvM?hNw6?X#!`X@>P$yatSJwm1^jPqKL5@T`%!gomft;Z>9J3Sg7Bz{Za
zw%4SA$KNY}fk1LR@ObL#faA%)Pu?>ZTGr-hYo*IY>v7fo{!cxP{)oi97AU5oaIE#o
zqQ^jTydhgUDsV#+=)YPdipKsFdX}-*Nnvuhb#xDOs2)h}od^v0Cjvu0d6Pr+A?fph
z*5e1HME|R9NTrgAGe>D|r5=87ax##F3PcB5&Lmx^qyhuJV)Q+6o<dqC0?9_CmOnKh
z?rn5XCFvSlZ%HQo<EY~!wagL=0b}eHh2^yI^l|o@{IQvv2=wor5awkd!LhVeg}_^B
zbz;CZ;6LMdf~1nJ17i+!GG`xu^lr{R$}U-53k>9R@c{eCahvL71vNh)l20C`bu0DA
zJCl=x3n<@`Ln$XUtouN2pB$u%w32)ilJ8@E$UjaaCnHgM$DdJE4nTj(ajAbi=|8L5
zMTU0i+P;PTd&h-YI=Be!t48*t5yjRHmVnZ~_pBo^Z?Mb~+Xmv;g+$)Bd~k_HUQgP|
zCkFgylTQYc&!?XGBXs@almXUIjBZEr*}An1I_OqLwn1L!l=&$OQCX)L11i5b&oC%M
zsRSA$S;{$CLC!he$8zZ%_j8bB%BZA-cK?JUu|hVQo)zQNzyfYS&5*H{z>t4JhTN9R
zi=YT$IX_f_Q%=7Ks(q44b3cCj{ruH4lV{dUIf=(+OGBUyU^UQlLHe30M@gmvrCfR6
zSpieIqffeWVqKz}<({$Wp_GIBpeMuFe{hC2;o=g&!f_;!OdN)hBf^{sa9AW}%btwB
ztYUuzGr@ln<_}Y47?mSD8mEcK^^yL)C&j)Q{d<SS=UM+@=nwc$uJaG?Tf%T9G@ym)
zpY)&Z?>gxi`}Kf-c%A>`zWLycShl)`!BMN(PyU+{_IM!qa_Uv;O0qR2oAQyV0T-za
z2*+^Je`=uR6tGnCIm(1zs%~42WtvCBKO|XPN&`2jVXA4SfOrv*rx1mwtSHd$8;Cxo
zy*^6IaB5xJt0lNf!mE)X|0!^2cApmJMNnbyls`U_vUlEp$}#q=>f&n?Ru^YkT|6cB
zT>ym<>deJZPST>tohyP=e-{kU2&Bdq)hAC-d=|k@LsDw|J(=u3;k}{e#*fmy8`B=0
zi<^WG?%ow7m8W~9X=9hju+a$GyLSPU?cJN5yL)T@V0G^#su|s*u`9>eoklVbV+e*t
z;vDHu(myi#h#nS68%FMpjMD0>qTfxnRDumiPg_T9Jwb}>O$pOOfmYe3#`AU(r3_NZ
z42Z<WP@RVFWB&#W6Gf(ZJ_9vV4ZyRZ)R);n>*>IqFPJVGSEpRFUrw!g3vCYhPs=nL
zXdSi$enHC~1Q#lSVI_dv=|54<>5cffl6&7tCMNp#zT-%I;<mkLA9pCrj()Ea*SN7a
zCntZnA6L6ULXXn#%hVr0<F#UtWRKGAW9kvQnNh2enlf;4Z%T#oLTX=y(nnFH_$14$
z{M-$LoS$<@vj2q3%1`nSh9;5;c@+!{h=G=~D%6W%iv56;o0?ORM_vx4K8JWE{qNW)
zEl9Ef|2yg`Pl-{MRw=V$_8sU^%zkke*5OLo2L|f<6sRX4t^!4<3e>-o3Dw+`K+zRo
zN}S$>0>`P00+AJ`&0uq!enpZWGEUFJRQ@>CBPyA3sz3&OaGdUxQ}*T558n8&ary^}
z(^ny`;zX#5(>KY)2gb>*a_MIf<`|uo;c7jt7{}6#7ZgLz*FnloN{ExlGDP(BpqvFD
z{74hD#J4m-OMFEW=m!qjxSI)7A6E4dtAU#}fqp)b#CA=f-%muSX9Cq9P<6RD{K`gu
zUe;UGTB8zuCoKs{T2s_o@)?`>HB^^N(Oi`-L#efjEiGSa6J2hjf6hh^t2(CSP->e^
z<}%DLeJgqVb-wc>p^JX6B1v_j@>Di9NMUCmm)Ml=vMY}Q(L(3hly8Hwx>H)omn{R5
zobG2)Womtz`VyJyKjF?;EOIYqk5cX}gS^T;LRIcv0$RS@+j*eo`kK$wBqwWHYMLAF
zz0kABjURvaR%`}rs!zUEpZsaV#jju?DGogTZb53-INZ7Occ#1Y1^s)mA^F>e<Xd&H
zFuCC8f&Sx;z!hVO-@@nO8(M2_tZA*esm3^dApQID4g7wW_V}l~1A8cLajEDPy*E)(
zI+hl!qrK)8sC&^|FX}Fe0^kgc$|1mVz+-^_3^)Qf7xMyUL>r(Ra1hW3_$36q4R9QA
zKj0w@{UN}o0FMDKz~GDkwgJ*MQjAt^z|F|UZompG00#-jf_V(^9>5X6uL07g@@s(Q
zfb!lOa04zzv~zF^;N5`#2>7>v{|fjN;38bj#sRMcbYa3p0lk0^12zJ_2-pqyd%y#L
zOL4(D0=NzEG+;O21mFmuZw5t6?Q0Ws?Aan5y)MVnxigCoIA*$Nznh+A9Q&`y$xBFp
z3(=`$%By&j{NdLoC*@VN#I>QM?3&U!w-oOeS1(z2$>l39AU%?)!{;W9&G|&ADRJH9
ztUYJOjc6Ds@k98uf&UPo#dqE>1&DtKKBvHM%-~;Z@xKmwA;!EpgMXdHKLL6*_%dO1
z`_63^{|xxM!GAtO{~3#4h@9~tceZ8ln=Sqd@H@b#yQj4O-?I31;7@>GZs)g4w(39l
z0y%iCo$uUW>E8kVO7I&p_!}jE1!!Lfe=GQ<WJmYU-(OHr<WP-(OmU>**wfe`M}B4j
zZFLu@@mJ$Xww5FJ>E}%0t;>9tt&R5-^cOmxC1WH*emtk;?#(ZECFaV#m^<fZ`?WaJ
zuMp(!!koGacC9x1l<RW*!T&n=3+?<y#V3D$j?Y)YC%+2+a*97bk|aAPVP_C>7ol#o
z6HK@BD)=YBUuEZarTKF)m!AW_(#}VmcR_^guLS=$;OFZ{1NcQ)GxGI=#_?_F%YJ+}
ze?K0Aon^3-uOE+szXJSx{Wt~w8u0V=<1F|a!Oz!^1%*O{!Oz!^PQ-CL_!k2f4rceG
z;5;YC>qgkQ0c&Qyc5Vf~5Byy1)FIw~4t_WIVH%J1C9eCO>r2Y+EAW@N?=4(kQhrZS
zpu~IEj6g|s|IAG#zMhimni6kKN%{H`H{>9{zNA<_=Q{&C2Vn>9W|YZE$2pZ)Kd&sp
z)nkW=&Ep(|xeFk%yr@E41qgv`e6b7krA3J8#i&#jeX&r~KaT)Um+1&hM_@Vv(-D}C
zz;pzrBQPC-=?F|mU^)WR5txp^|K|wI_Q~FTd%l7{Jy*eZ7bw`bSizB53JNZ?g+wJA
z(mQ*0I=!PuWv&9E9GhHJ^t)n(c)x?n$K-eVJ?o{6%RM^OmoPq2(I#uOze9!gEUCQt
z-eip6L8p&^_0ISHLWT2os~C1Fd^TjLoM8X-yK!ZTEaV;s*9llV1bEU&Mej|xSzqtV
z(u-tN7Aqi%XZmDK(@)P(xc1x2a{8S;-9FxglKtsmd2AU=T>F9TSBcj#pUwQA1N|O*
zc0)UPTz50Pi{Y0Tev{#244-899K&BTe2d`>&bLKbd8gaO>!zP{m$&RlM9qYIwWrGC
ztyq(gSmnOTH6Cx3r?T>5#c;3kR<7}`@m`^I^T7gSbG6eqg<XKrZq7+B5N1w#p_PYr
zV+F`coqw718A9i2CVi&JHNFMNdYu=U^0S1_uT1)ED-Sd2bFBH8NuMhkc^oq7=LmO>
z@hHHX_xk)trhKW;^E;F75-y(ine=(q`GrjSe9`zZpPeM@1>#&m+v3@!0K16#yoQ}u
zfLX2Ak4*X^JWyz}lVrUBvp8427l<;U-xszk70@ci>q91eiRjHqPrvt`DX&+zG?kW_
zLh(9YX2>kGt~$h2|7ksSVqDs?#*5Zfq94kldzhZR&euu%OT}S4kEFuOooJHvsqx$c
zI@uR|T_GJRcj4p6F)rT#Jy*ZJE9I98dZ~koZuehMC;L&pUdg>`(0<2seI3*5_be#B
zpM824f=agiFY|R!+dmfq)ULihYWv;~uutz0<g$O1udmwvC)vKf?rQtje}H{@PMpjB
zy2U<8*Y?}kzP_Go`yl6xj|qkYCpLPs=GX0#J~iK{v0QP!j~c)U4}BhqFe>z(z9Ywc
z`6nsAV9Gpwis{+&`UPoc>O5^O6vB<WhU|HF2J-Wj3mM;klyu}RuS@#+J_nWg828_D
zKG3ruDqCTn=z86|M3KeESbitVS2Fz*Oy6JPlN9-E5VdtoUpYt7n<ZC>>p*vN-41Tb
zL+@cbQI}7O(=$UV4=}xi{gKb8K>voMOOcGPB1xaRZvP;U{7Y>ACH7xFvxUXC^2jg5
z4GhKY37)??o*!p=>Kvc+=UVpalT80PuP2R6-y-RZ*gz-K={+!ec>r{`oxt_)<gxR6
z(C6XAhrUi>xMgwhxUb>)tK&JJ>Gv^RkGq@co96kXzI^tIS~ciyNy+@$0=g?l-Ws6K
zb1o6|TED&AO!OS*r)~$G;#|e~rsMn$l!<;3$MbwPc0b#vH|gw!p6QW19ao?dmfu2r
zo9Wqk{zK4R@F&|(b)IhOJbIGt1lXU4*#6I$p6%zanO?>Dyo%-DW_ot~i}8?;{6EHd
zRnGEmrf0|JxI_7Wgx6IT7Zp-oV`+FT+qu8gCy9FAeU|03&%s>)`{Yk{{(qnCxY*A}
zxQVAhr+mnc=P=u+mj>+Rb+&UO=b?^|13!S~+XcD4AP;?|q?d@t=K7@MHkOaE|8#DJ
z3O!S%@=Y24srQq0Y-c~O4>u`sA=-P)xS80w(}P24#x=EDjE4HAW}M(lAJj9<E~A}}
z>fs2V5sDeRI%7M6okqxv^~8-}qF1!Xy1F~VW;o<oyZVZ%+(O3ANHk&udwPO>MmTEr
z^ogB4!LG0oN_2JgLB)m{kTf$y8*q-$)85@JkIgky8%88XGC->;4Lba0;^-bxA~^WB
z2N+Hw261*S6vlDBM7zYjk%%xhHe9#9rU5F69Y(!@qkUCmx^@-L6Mi}oPJ~q>Q>0c)
zrW9*3gY7rx6O&9S))?#T%Oxd`=o!X_Ej63`hJSM%9hH<(*L9q$HT(e<2-Iz{e7<hO
zh9*CbCDyEO@RL$TkV2URc?we)b=x-AY^twKA2Ia#<f%YD{>Ntr+v5p2I3%`O^?=V;
zs&3a&bd2q5gP{=hs!@il$tzDr%6c_88zMb%6K5Dd%rVgItGqqo-8iQirr=*6F*{^<
zm0{_H#Mg$S5|UMUiZjdm+~+c<2uT+!D?^cZcW1DVdO+RDJ~qi}d|r|wp@y6zp^U(7
zGtm=m2%@X<04m!?|7&AW1U;%kkUpO|#cZyltXVF<-zixfWBmxHO|u)g4pSx+i5iJ`
z7>T1ty{bDA?~uXfG~i>lmEK@?H_pz|VA%$r+{}Go*9Zm8pgNL@KsRry)rn4raOuoz
zmOnfTRdYrt9y2;HdFfEF8YN0lp6)y>EV?5e*UhjEN>VvIlrucJGm?32D6Eo7j-N_*
zPH-h&S*ZqDC3Jd}wNS>H<Lr)1No+Ztti=APXOOd-VNa2cU9sI^osMA&J59hTr=Wd4
z+W}x}yf5#Lb;~ryIp(YuGL9aD$482FNGV3ta(0Z?@+5;*;feQknZX@^W{-j$x)zDz
zP<XfSL}O;ygLBChW^fl{yP^rtjzk3iogfkt9>O|;@ebh$^+jP%L9<73Xa&JSpMe<Q
z^@KZvq`<ZAPE&Yf`gl<F?1}-!*=c;!6$wHy88=V3gRemyAsEpZtm8;_xVJsrZ5rqY
zvQipTmnUUI*FW11MKm1jinK#7W>SNo(6D%rtHOf|Wfv}f`qKNqfwX^sTLAnPRz>fZ
z>Ho`-y>mgb_VRHcv=^%No1H#j>HmA-mRR}=w-p(M?yK$krqd_+CL3HKvGiBAejQkN
zr7x!2Kj`#H;e$-5l305GxR`MbHls2JAFZ$V^M;vlm^+Ny9vLUCulIF713G?MSo(V3
zZ$CS#_oE>qOLqL|{)zU2b^CgMknXdn=>Fq2P!=tx;mx4Z-m=E^KB7Dk4PLiW6J(D3
z)c!MB(Ebj&s`d4L<7sZ+%YwRnt*`rk2kWnAIlVt#%p2rx?l9@o9#*#geV~yDH)ri%
zmb2gz@a%=dYLSwt+4c24XCvzmTav2cVqC+Avh>}&kLI4G1hv1cX8Eu2zsS<p`v+du
ze+F9+_M+R>w7*8h?!Vq&E#v^R87(fy%0f{2JJ#3Zr+?qNSYJPv(K^}j`(Bp5oA*of
z|DVzSXC|Ni(JXzvuiHq2jj~cFjzXuz?`hDf|Jr}O|9k5)rO?WH8j!5Lya0qkOu0=(
z?<eX1XH%}o)_3-J{sx><e6+saPoAhyD%tYc_!|%-pR~TU@9g<-`V$b-bCWdm{<Qvo
zL*v|GJwJ5&I*$%Q$KJl)$DX*1tfl9h!qT|5<AAbV-`el?Dve&P$WZHPI6F&U@6YwJ
zzV=g_(RvzpL7!+keusF!;%?S2Bj;?zZL3ptA-B)s7FX-9wkWEi&1pCfWZkx1^kH7m
zmT5s|W}z9mYu7)<4&6-`7nJ4rT#b+JKTl8mAFbT&2d)GI<$68v3YG0~Rf7KkeDfSW

literal 0
HcmV?d00001

diff --git a/Poly.cpp b/Poly.cpp
new file mode 100644
index 0000000..5ab000f
--- /dev/null
+++ b/Poly.cpp
@@ -0,0 +1,41 @@
+#include "List.h"
+#include "Queue.h"
+#include "Stack.h"
+#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    List *myList1 = new List,
+         *myList2 = new List;
+    myList1->addFirst(1);
+    myList1->addFirst(0);
+    myList1->addFirst(1);
+    myList1->addFirst(0);
+    myList1->addFirst(5);
+    myList1->display();
+    myList2->addFirst(1);
+    myList2->addFirst(2);
+    myList2->addFirst(3);
+    myList2->display();
+    myList1->displayPoly();
+    myList2->displayPoly();
+    List *result = addPoly(myList1, myList2);
+    myList1->display();
+    myList2->display();
+    if (result != NULL)
+        result->display();
+    myList1->display();
+    myList2->display();
+    myList1->displayPoly();
+    myList2->displayPoly();
+    result->displayPoly();
+    cout << myList1->returnFirst() << endl;
+    myList1->removeFirst();
+    myList1->display();
+    cout << myList1->returnLast() << endl;
+    myList1->removeLast();
+    myList1->display();
+    return 0;
+}
\ No newline at end of file
diff --git a/Queue.cpp b/Queue.cpp
new file mode 100644
index 0000000..afdddec
--- /dev/null
+++ b/Queue.cpp
@@ -0,0 +1,23 @@
+#include "Queue.h"
+
+Queue::Queue()
+{
+    queue = new List;
+}
+
+void Queue::enQueue(int newdata)
+{
+    queue->addLast(newdata);
+}
+
+int Queue::deQueue()
+{
+    int ret = queue->returnFirst();
+    queue->removeFirst();
+    return ret;
+}
+
+Queue::~Queue()
+{
+    delete queue;
+}
\ No newline at end of file
diff --git a/Queue.h b/Queue.h
new file mode 100644
index 0000000..c41d82e
--- /dev/null
+++ b/Queue.h
@@ -0,0 +1,18 @@
+#ifndef QUEUE_H
+#define QUEUE_H
+
+#include "List.h"
+
+class Queue
+{
+  private:
+    List *queue;
+
+  public:
+    Queue();
+    void enQueue(int);
+    int deQueue();
+    ~Queue();
+};
+
+#endif // QUEUE_H
\ No newline at end of file
diff --git a/Stack.cpp b/Stack.cpp
new file mode 100644
index 0000000..a0b702e
--- /dev/null
+++ b/Stack.cpp
@@ -0,0 +1,23 @@
+#include "Stack.h"
+
+Stack::Stack()
+{
+    stack = new List;
+}
+
+void Stack::push(int newdata)
+{
+    stack->addFirst(newdata);
+}
+
+int Stack::pop()
+{
+    int ret = stack->returnFirst();
+    stack->removeFirst();
+    return ret;
+}
+
+Stack::~Stack()
+{
+    delete stack;
+}
\ No newline at end of file
diff --git a/Stack.h b/Stack.h
new file mode 100644
index 0000000..447f69b
--- /dev/null
+++ b/Stack.h
@@ -0,0 +1,18 @@
+#ifndef STACK_H
+#define STACK_H
+
+#include "List.h"
+
+class Stack
+{
+private:
+  List *stack;
+
+public:
+  Stack();
+  void push(int);
+  int pop();
+  ~Stack();
+};
+
+#endif // STACK_H
\ No newline at end of file
diff --git a/makefile b/makefile
new file mode 100644
index 0000000..a581680
--- /dev/null
+++ b/makefile
@@ -0,0 +1,12 @@
+all: List.o Queue.o Stack.o Poly.o
+	g++ -o Poly List.o Queue.o Stack.o Poly.o
+List.o: List.h List.cpp
+	g++ -c List.h List.cpp
+Queue.o: Queue.h Queue.cpp
+	g++ -c Queue.h Queue.cpp
+Stack.o: Stack.h Stack.cpp
+	g++ -c Stack.h Stack.cpp
+Poly.o: Poly.cpp
+	g++ -c Poly.cpp
+clean:
+	rm -f *.o Poly