Data-Structure-Course/Stack.h at master · MrMinos/Data-Structure-Course · 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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
// Lab 8a, Write And Apply A Stack Template
// Programmer: Minos Park
// Editor(s) used: Sublime Text 2
// Compiler(s) used: G++

#ifndef Stack_h
#define Stack_h

template <class DataType>
struct Node
{
  Node* prev = NULL;
  DataType data;
  Node* next = NULL;
};

template <class DataType>
class Stack
{
  Node<DataType>* root = NULL;
  Node<DataType>* step = NULL;
  Node<DataType>* last = NULL;
  DataType temp, dummydata;

  public:
  Stack();
  ~Stack();
  DataType pop();
  DataType peek(){return last->data;}
  void push(DataType);
  int size();
  bool empty(){return (size() == 0?true:false);}
  Stack(const Stack<DataType>& a);
  Stack<DataType>& operator=(const Stack<DataType>& a);
  void clear();
};

template <class DataType>
Stack<DataType>::Stack()
{
  root = new Node<DataType>;
  root->prev = NULL;
  root->next = NULL;
  step = root;
  last = root;
}

template <class DataType>
Stack<DataType>::~Stack()
{
  step = root;
  while (step != NULL)
  {
  	last = step->next;
  	delete step;
  	step = last;
  }
}

template <class DataType>
DataType Stack<DataType>::pop()
{
  if (last != root)
  {
  	temp = last->data;
    last = last->prev;
    delete last->next;
    last->next = NULL;
    return temp;
  }
  else return dummydata;
}

template <class DataType>
void Stack<DataType>::push(DataType datum)
{
  last->next = new Node<DataType>;
  step = last;
  last = last->next;
  last->prev = step;
  last->next = NULL;
  last->data = datum;
}

template <class DataType>
int Stack<DataType>::size()
{
  int size = 0;
  step = root->next;
  while (step != NULL)
  {
  	size++;
  	step = step->next;
  }
  return size;
}

template <class DataType>
Stack<DataType>::Stack(const Stack<DataType>& a)
{
  Node<DataType>* end = NULL;
  for (step = a.root; step; step = step->next)
  {
  	Node<DataType>* node = new Node<DataType>;
  	node->data = step->data;
  	node->next = NULL;
  	node->prev = end;
  	if (end) end->next = node;
  	else root = node;
  	end = node;
  }
  last = end;
}

template <class DataType>
Stack<DataType>& Stack<DataType>::operator=(const Stack<DataType>& a)
{
  if (this != &a)
  {
  	Node<DataType>* end = NULL;

  	while (root)
  	{
  	  step = root->next;
  	  delete root;
  	  root = step;
  	}
  	for (step = a.root; step; step = step->next)
  	{
  	  Node<DataType>* node = new Node<DataType>;
  	  node->data = step->data;
  	  node->next = NULL;
  	  node->prev = end;
  	  if (end) end->next = node;
  	  else root = node;
  	  end = node;
  	}
  	last = end;
  }
  return *this;
}

template <class DataType>
void Stack<DataType>::clear()
{
  if (step != root)
  {
  	step = root->next;
    while (step)
    {
  	  delete step;
  	  step = step->next;
    }
    root->next = NULL;
    last = root;
    step = root;
  }
}

#endif