EC327_Homework7/LinkedList.cpp at main · thangle2/EC327_Homework7 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include "LinkedList.h"

#include <stdexcept>
using namespace std;

//Do not change this file

template<typename T>
LinkedList<T>::LinkedList()
{
    head = NULL;
    tail = NULL;
    size = 0;
}

template<typename T>
LinkedList<T>::~LinkedList()
{
    while(size > 0){
        removeFirst();
    }
}

template<typename T>
void LinkedList<T>::addFirst(T element)
{
    Node<T>* newNode = new Node<T>(element);
    newNode->next = head;
    head = newNode;
    if(tail == NULL){
        tail = head;
    }
    size++;
}

template<typename T>
void LinkedList<T>::addLast(T element)
{
    Node<T>* newNode = new Node<T>(element);
    if(tail == NULL){
        head = newNode;
        tail = newNode;
    }
    else {
        tail->next = newNode;
        tail = newNode;
    }
    size++;
}

template<typename T>
T LinkedList<T>::getFirst() const throw (runtime_error)
{
    if(size == 0){
        throw runtime_error("No elements in the list");
    }
    else {
        return head->element;
    }
}

template<typename T>
T LinkedList<T>::getLast() const throw (runtime_error)
{
    if(size == 0){
        throw runtime_error("No elements in the list");
    }
    else {
        return tail->element;
    }
}

template<typename T>
T LinkedList<T>::removeFirst() throw (runtime_error)
{
    if(size == 0){
        throw runtime_error("No elements in the list");
    }
    else {
        Node<T>* temp = head;
        head = head->next;
        size--;
        if(head == NULL){
            tail = NULL;
        }
        T element = temp->element;
        delete temp;
        return element;
    }
}

template<typename T>
T LinkedList<T>::removeLast() throw (runtime_error)
{
    if(size == 0){
        throw runtime_error("No elements in the list");
    }
    else if (size == 1){
        Node<T>* temp = head;
        head = tail = NULL;
        size = 0;
        T element = temp->element;
        delete temp;
        return element;
    }
    else {
        Node<T>* current = head;
        for(int i = 0; i < size - 2; i++){
            current = current->next;
        }
        Node<T>* temp = tail;
        tail = current;
        tail->next = NULL;
        size--;
        T element = temp->element;
        delete temp;
        return element;
    }
}

template<typename T>
int LinkedList<T>::getSize(){
    return size;
}

template class LinkedList<int>;