-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStacksLinked.py
More file actions
69 lines (58 loc) · 1.27 KB
/
StacksLinked.py
File metadata and controls
69 lines (58 loc) · 1.27 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
class _Node:
__slots__ = '_element', '_next'
def __init__(self, element, next):
self._element = element
self._next = next
class StacksLinked:
def __init__(self):
self._top = None
self._size = 0
def __len__(self):
return self._size
def isempty(self):
return self._size == 0
def push(self, e):
newest = _Node(e, None)
if self.isempty():
self._top = newest
else:
newest._next = self._top
self._top = newest
self._size += 1
def pop(self):
if self.isempty():
print('Stack is empty')
return
e = self._top._element
self._top = self._top._next
self._size -= 1
return e
def top(self):
if self.isempty():
print('Stack is empty')
return
return self._top._element
def display(self):
p = self._top
while p:
print(p._element,end='-->')
p = p._next
print()
S = StacksLinked()
S.push(5)
S.push(3)
print(len(S))
S.display()
print(S.pop())
print(S.isempty())
print(S.pop())
print(S.isempty())
S.push(7)
S.push(9)
print(S.top())
S.push(4)
print(len(S))
print(S.pop())
S.push(6)
S.push(8)
print(S.pop())