-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDS_Stack.h
More file actions
105 lines (93 loc) · 1.45 KB
/
DS_Stack.h
File metadata and controls
105 lines (93 loc) · 1.45 KB
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
#ifndef DS_STACK_H
#define DS_STACK_H
#include "assert.h"
namespace DataStructures
{
template<class T>
class Stack
{
public:
Stack();
void Push(T); //push an item onto the stack
T Pop(); //pop an item from stack
T Peek();
bool IsEmpty();
void Clear();
~Stack();
private:
struct StackNode
{
T _current;
StackNode *_below;
StackNode(T C, StackNode *B = 0) : _current(C), _below(B) {}
};
int _size;
StackNode *_top;
};
//constructor
template<class T>
Stack<T>::Stack(void)
{
_size = 0;
_top = 0;
}
//adds an item to the stack
template<class T>
void Stack<T>::Push(T s)
{
StackNode *P = new StackNode(s,_top);
_size++;
_top = P;
}
//returns top of the stack
template<class T>
T Stack<T>::Pop(void)
{
assert(!IsEmpty());
T t;
StackNode temp(t);
temp = *_top;
delete _top;
_size--;
if (_size)
_top = temp._below;
else
_top = 0;
return temp._current;
}
//returns top of the stack
template<class T>
T Stack<T>::Peek(void)
{
assert(!IsEmpty());
return _top->_current;
}
//returns true if stack is empty
//returns false if stack is not empty
template<class T>
bool Stack<T>::IsEmpty(void)
{
return (!_size);
}
//Removes all items from stack
template <class T>
void Stack<T>::Clear()
{
while (!IsEmpty())
{
Pop();
}
delete _top;
_top = 0;
}
//Destructor
template<class T>
Stack<T>::~Stack(void)
{
while (!IsEmpty())
{
Pop();
}
}
}
#endif