-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathLQueue.cpp
More file actions
58 lines (51 loc) · 942 Bytes
/
LQueue.cpp
File metadata and controls
58 lines (51 loc) · 942 Bytes
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
//linked queue implementation
template <typename E> class LQueue: public Queue<E>
{
private:
Link<E>* front;
Link<E>* rear;
int size;
public:
LQueue(int sz =defaultSize)
{
front = rear = new Link<E>(); size = 0;
}
~LQueue() {clear(); delete front;}
void clear()
{
while <front->next != NULL>
{
rear = front;
front = front->next;
delete rear;
}
rear = front;
size=0;
}
void enqueue(const E& it)
{
rear->next = new Link<E>(it, NULL);
rear = rear->next;
size++;
}
E dequeue()
{
Assert(size != 0, "Queue is empty");
E it = front->next->element;
Link<E>* ltemp = front->next;
front->next = ltemp->next;
if (rear == ltemp) rear = front;
delete ltemp;
size--;
return it;
}
const E& frontValue() const
{
Assert(size != 0, "Queue is empty");
return front->next->element;
}
virtual int length() const
{
return size;
}
};